


default search action
7th DLT 2003: Szeged, Hungary
- Zoltán Ésik, Zoltán Fülöp:
Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings. Lecture Notes in Computer Science 2710, Springer 2003, ISBN 3-540-40434-1
Invited Presentations
- Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
Quantum Computing: 1-Way Quantum Automata. 1-20 - Javier Esparza
:
An Automata-Theoretic Approach to Software Verification. 21 - Ferenc Gécseg:
Comments on Complete Sets of Tree Automata. 22-34 - Antonio Cano Gómez, Jean-Eric Pin:
On a Conjecture of Schnoebelen. 35-54 - Friedrich Otto:
Restarting Automata and Their Relations to the Chomsky Hierarchy. 55-74 - Wojciech Plandowski:
Test Sets for Large Families of Languages. 75-94 - Heribert Vollmer:
Complexity Theory Made Easy. 95-110
Contributions
- Dimitry S. Ananichev, Mikhail V. Volkov
:
Synchronizing Monotonic Automata. 111-121 - Marcella Anselmo, Maria Madonia:
Covering Problems from a Formal Language Point of View. 122-133 - Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
Regular Languages Generated by Reflexive Finite Splicing Systems. 134-145 - Björn Borchardt:
The Myhill-Nerode Theorem for Recognizable Tree Series. 146-158 - Anne Bouillard, Jean Mairesse:
Generating Series of the Trace Group. 159-170 - Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi:
Residual Finite Tree Automata. 171-182 - Pascal Caron, Marianne Flouret:
From Glushkov WFAs to Rational Expressions. 183-193 - Jean-Marc Champarnaud, Fabien Coulon:
NFA Reduction Algorithms by Means of Regular Inequalities. 194-205 - Stefano Crespi-Reghizzi, Matteo Pradella
:
Tile Rewriting Grammars. 206-217 - Erzsébet Csuhaj-Varjú, Victor Mitrana
, György Vaszil:
Distributed Pushdown Automata Systems: Computational Power. 218-229 - Flavio D'Alessandro, Stefano Varricchio:
On Well Quasi-orders on Languages. 230-241 - Diego de Falco, Massimiliano Goldwurm, Violetta Lonati:
Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models. 242-253 - Michael Domaratzki:
On Enumeration of Müller Automata. 254-265 - Frank Drewes, Joost Engelfriet:
Branching Grammars: A Generalization of ET0L Systems. 266-278 - Frank Drewes, Johanna Högberg:
Learning a Regular Tree Language from a Teacher. 279-291 - Rudolf Freund, Carlos Martín-Vide, Adam Obtulowicz, Gheorghe Paun:
On Three Classes of Automata-Like P Systems. 292-303 - Dora Giammarresi:
Computing Languages by (Bounded) Local Sets. 304-315 - Tero Harju
, Dirk Nowotka:
About Duval's Conjecture. 316-324 - Lane A. Hemaspaandra
, Proshanto Mukherji, Till Tantau:
Computation with Absolutely No Space Overhead. 325-336 - Dieter Hofbauer, Johannes Waldmann:
Deleting String Rewriting Systems Preserve Regularity. 337-348 - Markus Holzer
, Barbara König:
On Deterministic Finite Automata and Syntactic Monoid Size, Continued. 349-360 - Markus Holzer
, Martin Kutrib
:
Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. 361-372 - Ines Klimann, Sylvain Lombardy, Jean Mairesse, Christophe Prieur:
Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton. 373-385 - Andreas Malcher
:
Minimizing Finite Automata Is Computationally Hard. 386-397 - Alexander Okhotin:
Boolean Grammars. 398-410 - Libor Polák:
Syntactic Semiring and Universal Automaton. 411-422 - George Rahonis
:
Alphabetic Pushdown Tree Transducers. 423-436

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.