Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Comput. AND Volume=218
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Church problem for expansions of
(\mathbb N,<)
by unary predicates
Alexander Rabinovich
Information and Computation
218
, 2012, pp. 1-16
Automatic learning of subclasses of pattern languages
John Case
,
Sanjay Jain
,
Trong Dao Le
,
Yuh Shin Ong
,
Pavel Semukhin
,
Frank Stephan
Information and Computation
218
, 2012, pp. 17-35
On the complexity of minimizing probabilistic and quantum automata
Paulo Mateus
,
Daowen Qiu
,
Lvzhou Li
Information and Computation
218
, 2012, pp. 36-53
EXPTIME-completeness of thorough refinement on modal transition systems
Nikola Benes̑
,
Jan Kȓetínský
,
Kim G. Larsen
,
Jiȓí Srba
Information and Computation
218
, 2012, pp. 54-68
The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types
Ken-etsu Fujita
,
Aleksy Schubert
Information and Computation
218
, 2012, pp. 69-87