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=Theor.~Comput.~Sci. AND Volume=578
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the state complexity of partial word DFAs
Eric Balkanski
,
F. Blanchet-Sadri
,
Matthew Kilgore
,
B.J. Wyatt
Theoretical Computer Science
578
, 2015, pp. 2-12
Trimming visibly pushdown automata
Mathieu Caralp
,
Pierre-Alain Reynier
,
Jean-Marc Talbot
Theoretical Computer Science
578
, 2015, pp. 13-29
Compressed automata for dictionary matching
Tomohiro I
,
Takaaki Nishimoto
,
Shunsuke Inenaga
,
Hideo Bannai
,
Masayuki Takeda
Theoretical Computer Science
578
, 2015, pp. 30-41
On the boundary of regular languages
Jozef Jirásek
,
Galina Jirásková
Theoretical Computer Science
578
, 2015, pp. 42-57
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties
Martin Kutrib
,
Andreas Malcher
,
Carlo Mereghetti
,
Beatrice Palano
,
Matthias Wendlandt
Theoretical Computer Science
578
, 2015, pp. 58-71
Hyper-optimization for deterministic tree automata
Andreas Maletti
Theoretical Computer Science
578
, 2015, pp. 72-87
Lambda-confluence for context rewriting systems
Friedrich Otto
,
Frantis̑ek Mráz
Theoretical Computer Science
578
, 2015, pp. 88-99
Early nested word automata for XPath query answering on XML streams
Denis Debarbieux
,
Olivier Gauwin
,
Joachim Niehren
,
Tom Sebastian
,
Mohamed Zergaoui
Theoretical Computer Science
578
, 2015, pp. 100-125