default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID65th Birthday: Jürgen Dassow 2012
- Henning Bordihn, Martin Kutrib
, Bianca Truthe:
Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. Lecture Notes in Computer Science 7300, Springer 2012, ISBN 978-3-642-31643-2 - M. Sakthi Balan, Helmut Jürgensen:
Peptide Computers. 1-29 - Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Richard Královic, Peter Rossmanith:
On the Power of Randomness versus Advice in Online Computation. 30-43 - Andrzej Ehrenfeucht, Jetty Kleijn, Maciej Koutny, Grzegorz Rozenberg:
Relevance of Entities in Reaction Systems. 44-55 - Sigrid Ewert, Max Rabkin:
Generalized Random Context Picture Grammars: The State of the Art. 56-74 - Henning Fernau:
Cooperating Distributed Tree Automata. 75-85 - Markus Holzer:
A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems. 86-98 - Mari Huova, Juhani Karhumäki:
Equations in the Partial Semigroup of Words with Overlapping Products. 99-110 - Martin Kutrib, Friedrich Otto:
On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata. 111-137 - Klaus-Jörn Lange:
The Boolean Formula Value Problem as Formal Language. 138-144 - Florin Manea, Robert Mercas, Victor Mitrana:
Hairpin Lengthening and Shortening of Regular Languages. 145-159 - Alexander Meduna, Petr Zemek:
One-Sided Random Context Grammars with Leftmost Derivations. 160-173 - Taishin Y. Nishida:
Earley's Parsing Algorithm and k-Petri Net Controlled Grammars. 174-185 - Alexander Okhotin, Xiaoxue Piao, Kai Salomaa:
Descriptional Complexity of Input-Driven Pushdown Automata. 186-206 - Gheorghe Paun:
Towards "Fypercomputations" (in Membrane Computing). 207-220 - Arto Salomaa:
Undecidability of State Complexities Using Mirror Images. 221-235 - Ludwig Staiger:
Asymptotic Subword Complexity. 236-245 - Ralf Stiebe:
On Grammars Controlled by Parikh Vectors. 246-264 - György Vaszil:
On the Nonterminal Complexity of Tree Controlled Grammars. 265-272 - Shenggen Zheng, Daowen Qiu, Lvzhou Li, Jozef Gruska:
One-Way Finite Automata with Quantum and Classical States. 273-290
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-21 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
