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=450
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity of problems concerning reset words for cyclic and Eulerian automata
Pavel Martyugin
Theoretical Computer Science
450
, 2012, pp. 3-9
Smaller representation of finite state automata
Jan Daciuk
,
Dawid Weiss
Theoretical Computer Science
450
, 2012, pp. 10-21
Categorial grammars with iterated types form a strict hierarchy of
k
-valued languages
Denis Béchet
,
Alexandre Dikovsky
,
Annie Foret
Theoretical Computer Science
450
, 2012, pp. 22-30
Sampling different kinds of acyclic automata using Markov chains
Vincent Carnino
,
Sven De Felice
Theoretical Computer Science
450
, 2012, pp. 31-42
Loops and overloops for Tree-Walking Automata
Pierre-Cyrille Héam
,
Vincent Hugot
,
Olga Kouchnarenko
Theoretical Computer Science
450
, 2012, pp. 43-53
Analysis of a cellular automaton model for car traffic with a junction
Yo-Sub Han
,
Sang-Ki Ko
Theoretical Computer Science
450
, 2012, pp. 54-67
Nondeterministic state complexity of star-free languages
Markus Holzer
,
Martin Kutrib
,
Katja Meckel
Theoretical Computer Science
450
, 2012, pp. 68-80
Nondeterministic Moore automata and Brzozowski's minimization algorithm
G. Castiglione
,
A. Restivo
,
M. Sciortino
Theoretical Computer Science
450
, 2012, pp. 81-91
A finite state intersection approach to propositional satisfiability
José M. Castaño
,
Rodrigo Castaño
Theoretical Computer Science
450
, 2012, pp. 92-108
Using minimal absent words to build phylogeny
Supaporn Chairungsee
,
Maxime Crochemore
Theoretical Computer Science
450
, 2012, pp. 109-116