default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th DLT 2001: Vienna, Austria
- Werner Kuich, Grzegorz Rozenberg, Arto Salomaa:
Developments in Language Theory, 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001, Revised Papers. Lecture Notes in Computer Science 2295, Springer 2002, ISBN 3-540-43453-4
Invited Presentations
- Cristian Calude, Elena Calude:
Automata: From Uncertainty to Quantum. 1-14 - Christian Choffrut:
Elementary Theory of Ordinals with Addition and Left Translation by omega. 15-20 - Zoltán Ésik:
The Equational Theory of Fixed Points with Applications to Generalized Language Theory. 21-36 - Thomas Eiter, Georg Gottlob, Thomas Schwentick:
Second-Order Logic over Strings: Regular and Non-regular Fragments. 37-56 - Tero Harju
:
Decision Questions on Integer Matrices. 57-68 - Masami Ito, Yoshiyuki Kunimochi:
Some Petri Net Languages and Codes. 69-80 - Helmut Prodinger:
Words, Permutations, and Representations of Numbers. 81-99 - Alexander A. Razborov:
Proof Complexity of Pigeonhole Principles. 100-116 - Antonio Restivo, Sergio Salemi:
Words and Patterns. 117-129 - Wolfgang Thomas:
A Short Introduction to Infinite Automata. 130-144
Contributions
- Thierry Cachat:
The Power of One-Letter Rational Languages. 145-154 - Ludwig Staiger:
The Entropy of Lukasiewicz-Languages. 155-165 - Dimitry S. Ananichev, Mikhail V. Volkov:
Collapsing Words vs. Synchronizing Words. 166-174 - Karel Culík II, Juhani Karhumäki, Jarkko Kari:
A Note on Synchronized Automata and Road Coloring Problem. 175-185 - Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi:
Shuffle Quotient and Decompositions. 186-196 - Gundula Niemann, Jens R. Woinowski:
The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages. 197-205 - Dietrich Kuske:
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable. 206-216 - Zoltán Ésik, Zoltán L. Németh:
Automata on Series-Parallel Biposets. 217-227 - Joost Engelfriet, Sebastian Maneth:
Hierarchies of String Languages Generated by Deterministic Tree Transducers. 228-238 - Thomas Schwentick, Denis Thérien, Heribert Vollmer:
Partially-Ordered Two-Way Automata: A New Characterization of DA. 239-250 - Christian Glaßer, Heinz Schmitz:
Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. 251-261 - Juraj Hromkovic, Georg Schnitger:
On the Power of Randomized Pushdown Automata. 262-271 - Gerhard Lischke:
The Root of a Language and Its Complexity. 272-280 - Henning Fernau, Ralf Stiebe:
Valuated and Valence Grammars: An Algebraic View. 281-292 - Hendrik Jan Hoogeboom:
Context-Free Valence Grammars - Revisited. 293-303 - Vesa Halava, Tero Harju:
An Undecidability Result Concerning Periodic Morphisms. 304-310 - Manfred Kudlek, Yurii Rogozhin:
A Universal Turing Machine with 3 States and 9 Symbols. 311-318 - Michael Domaratzki, Jeffrey O. Shallit, Sheng Yu:
Minimal Covers of Formal Languages. 319-329 - Gundula Niemann, Johannes Waldmann:
Some Regular Languages That Are Church-Rosser Congruential. 330-339 - Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto:
On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. 340-348 - Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors and Fragment Assembly. 349-358 - Erzsébet Csuhaj-Varjú, György Vaszil:
Parallel Communicating Grammar Systems with Incomplete Information Communication. 359-368 - Branislav Rovan, Marián Slast'an:
Eliminating Communication by Parallel Rewriting. 369-278 - Petr Sosík, Rudolf Freund:
String Rewriting Sequential P-Systems and Regulated Rewriting. 379-388
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 2025-04-16 21:06 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
