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 YEAR=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
How inductive inference strategies discover their errors
Rūsiņs̆ Freivalds
,
Efim B. Kinber
,
Rolf Wiehagen
Information and Computation
118
(2), 1995, pp. 208-226
Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits
Rolf Niedermeier
,
Peter Rossmanith
Information and Computation
118
(2), 1995, pp. 227-245
Full abstraction and expressive completeness for FP
Joseph Y. Halpern
,
Edward L. Wimmers
Information and Computation
118
(2), 1995, pp. 246-271
Split and ST bisimulation semantics
Roberto Gorrieri
,
Cosimo Laneve
Information and Computation
118
(2), 1995, pp. 272-288
Regular languages defined with generalized quantifiers
Howard Straubing
,
Denis Thérien
,
Wolfgang Thomas
Information and Computation
118
(2), 1995, pp. 289-301
On embeddings in cycles
Juraj Hromkovic̑
,
Vladimír Müller
,
Ondrej Sýkora
,
Imrich Vrt̑o
Information and Computation
118
(2), 1995, pp. 302-305
Deciding branching bisimilarity of normed context-free processes is in
\Sigma_2^p
Didier Caucal
,
Dung T. Huynh
,
Lu Tian
Information and Computation
118
(2), 1995, pp. 306-315
On the learnability of infinitary regular sets
Oded Maler
,
Amir Pnueli
Information and Computation
118
(2), 1995, pp. 316-326
Economy of description for single-valued transducers
Andreas Weber
,
Reinhard Klemm
Information and Computation
118
(2), 1995, pp. 327-340
Seiten
<
1
2
3
4