Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Languages Alive: Essays dedicated to Jürgen Dassow on the Occasion of His 65th Birthday > Descriptional Complexity of Input-Driven Pushdown Automata
Languages Alive: Essays dedicated to Jürgen Dassow on the Occasion of His 65th Birthday |
Henning Bordihn; Martin Kutrib; Bianca Truthe
Springer Berlin Heidelberg
Languages Alive: Essays dedicated to Jürgen Dassow on the Occasion of His 65th Birthday
Descriptional Complexity of Input-Driven Pushdown Automata
Authors

Alexander Okhotin; Xiaoxue Piao; Kai Salomaa

ARI Id

1664714343273_2877387

Access

Not Available Free

Pages

186-206

DOI

10.1007/978-3-642-31644-9_13

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-31644-9_13

Table of Contents of Book
Showing 1 to 20 of 21 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Peptide Computers
M. Sakthi Balan; Helmut Jürgensen
1-29
On the Power of Randomness versus Advice in Online Computation
Hans-Joachim Böckenhauer; Juraj Hromkovič; Dennis Komm; Richard Královič; Peter Rossmanith
30-43
Relevance of Entities in Reaction Systems
Andrzej Ehrenfeucht; Jetty Kleijn; Maciej Koutny; Grzegorz Rozenberg
44-55
Generalized Random Context Picture Grammars: The State of the Art
Sigrid Ewert; Max Rabkin
56-74
Cooperating Distributed Tree Automata
Henning Fernau
75-85
A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems
Markus Holzer
86-98
Equations in the Partial Semigroup of Words with Overlapping Products
Mari Huova; Juhani Karhumäki
99-110
On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata
Martin Kutrib; Friedrich Otto
111-137
The Boolean Formula Value Problem as Formal Language
Klaus-Jörn Lange
138-144
Hairpin Lengthening and Shortening of Regular Languages
Florin Manea; Robert Mercas; Victor Mitrana
145-159
One-Sided Random Context Grammars with Leftmost Derivations
Alexander Meduna; Petr Zemek
160-173
Earley’s Parsing Algorithm and k-Petri Net Controlled Grammars
Taishin Y. Nishida
174-185
Descriptional Complexity of Input-Driven Pushdown Automata
Alexander Okhotin; Xiaoxue Piao; Kai Salomaa
186-206
Towards “Fypercomputations” (in Membrane Computing)
Gheorghe Păun
207-220
Undecidability of State Complexities Using Mirror Images
Arto Salomaa
221-235
Asymptotic Subword Complexity
Ludwig Staiger
236-245
On Grammars Controlled by Parikh Vectors
Ralf Stiebe
246-264
On the Nonterminal Complexity of Tree Controlled Grammars
György Vaszil
265-272
One-Way Finite Automata with Quantum and Classical States
Shenggen Zheng; Daowen Qiu; Lvzhou Li; Jozef Gruska
273-290
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 21 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings