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