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=449
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient unfolding of contextual Petri nets
Paolo Baldan
,
Alessandro Bruni
,
Andrea Corradini
,
Barbara König
,
César Rodríguez
,
Stefan Schwoon
Theoretical Computer Science
449
, 2012, pp. 2-22
The size-cost of Boolean operations on constant height deterministic pushdown automata
Zuzana Bednárová
,
Viliam Geffert
,
Carlo Mereghetti
,
Beatrice Palano
Theoretical Computer Science
449
, 2012, pp. 23-36
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
Janusz Brzozowski
,
Baiyu Li
,
Yuli Ye
Theoretical Computer Science
449
, 2012, pp. 37-53
Geometrical regular languages and linear Diophantine equations: The strongly connected case
Jean-Marc Champarnaud
,
Jean-Philippe Dubernard
,
Franck Guingne
,
Hadrien Jeanne
Theoretical Computer Science
449
, 2012, pp. 54-63
On external contextual grammars with subregular selection languages
Jürgen Dassow
,
Florin Manea
,
Bianca Truthe
Theoretical Computer Science
449
, 2012, pp. 64-73
On synchronized multi-tape and multi-head automata
Oscar H. Ibarra
,
Nicholas Q. Tran
Theoretical Computer Science
449
, 2012, pp. 74-84
Reversal of binary regular languages
Galina Jirásková
,
Juraj S̑ebej
Theoretical Computer Science
449
, 2012, pp. 85-92
On a structural property in the state complexity of projected regular languages
Galina Jirásková
,
Tomás̑ Masopust
Theoretical Computer Science
449
, 2012, pp. 93-105
State complexity of operations on two-way finite automata over a unary alphabet
Michal Kunc
,
Alexander Okhotin
Theoretical Computer Science
449
, 2012, pp. 106-118
Descriptional complexity of two-way pushdown automata with restricted head reversals
Andreas Malcher
,
Carlo Mereghetti
,
Beatrice Palano
Theoretical Computer Science
449
, 2012, pp. 119-133
Language classes generated by tree controlled grammars with bounded nonterminal complexity
Sherzod Turaev
,
Jürgen Dassow
,
Florin Manea
,
Mohd Hasan Selamat
Theoretical Computer Science
449
, 2012, pp. 134-144