Developments in language theory. 7th international conference, DLT 2003, Szeged, Hungary, July 7--11, 2003. Proceedings (Q1418341)

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1014.00024). Indexed articles: \textit{Bertoni, Alberto; Mereghetti, Carlo; Palano, Beatrice}, Quantum computing: 1-way quantum automata, 1-20 [Zbl 1037.68058] \textit{Esparza, Javier}, An automata-theoretic approach to software verification, 21 [Zbl 1037.68522] \textit{Gécseg, Ferenc}, Comments on complete sets of tree automata, 22-34 [Zbl 1037.68083] \textit{Cano Gómez, Antonio; Pin, Jean-Éric}, On a conjecture of Schnoebelen, 35-54 [Zbl 1037.68075] \textit{Otto, Friedrich}, Restarting automata and their relations to the Chomsky hierarchy, 55-74 [Zbl 1037.68088] \textit{Plandowski, Wojciech}, Test sets for large families of languages, 75-94 [Zbl 1037.68089] \textit{Vollmer, Heribert}, Complexity theory made easy. The formal language approach to the definition of complexity classes, 95-110 [Zbl 1037.68062] \textit{Ananichev, Dimitry S.; Volkov, Mikhail V.}, Synchronizing monotonic automata, 111-121 [Zbl 1037.68072] \textit{Anselmo, Marcella; Madonia, Maria}, Covering problems from a formal language point of view, 122-133 [Zbl 1037.68548] \textit{Bonizzoni, Paola; De Felice, Clelia; Mauri, Giancarlo; Zizza, Rosalba}, Regular languages generated by reflexive finite splicing systems, 134-145 [Zbl 1037.68073] \textit{Borchardt, Björn}, The Myhill-Nerode theorem for recognizable tree series, 146-158 [Zbl 1037.68074] \textit{Bouillard, Anne; Mairesse, Jean}, Generating series of the trace group, 159-170 [Zbl 1037.68097] \textit{Carme, Julien; Gilleron, Rémi; Lemay, Aurélien; Terlutte, Alain; Tommasi, Marc}, Residual finite tree automata, 171-182 [Zbl 1037.68076] \textit{Caron, Pascal; Flouret, Marianne}, From Glushkov WFAs to rational expressions, 183-193 [Zbl 1037.68077] \textit{Champarnaud, Jean-Marc; Coulon, Fabien}, NFA reduction algorithms by means of regular inequalities, 194-205 [Zbl 1037.68078] \textit{Crespi Reghizzi, Stefano; Pradella, Matteo}, Tile rewriting grammars, 206-217 [Zbl 1037.68067] \textit{Csuhaj-Varjú, Erzsébet; Mitrana, Victor; Vaszil, György}, Distributed pushdown automata systems: Computational power, 218-229 [Zbl 1037.68079] \textit{D'Alessandro, Flavio; Varricchio, Stefano}, On well quasi-orders on languages, 230-241 [Zbl 1037.68080] \textit{de Falco, Diego; Goldwurm, Massimiliano; Lonati, Violetta}, Frequency of symbol occurrences in simple non-primitive stochastic models, 242-253 [Zbl 1037.68105] \textit{Domaratzki, Michael}, On enumeration of Müller automata, 254-265 [Zbl 1037.68081] \textit{Drewes, Frank; Engelfriet, Joost}, Branching grammars: A generalization of ET0L systems, 266-278 [Zbl 1037.68068] \textit{Drewes, Frank; Högberg, Johanna}, Learning a regular tree language from a teacher, 279-291 [Zbl 1037.68082] \textit{Freund, Rudolf; Martín-Vide, Carlos; Obtułowicz, Adam; Păun, Gheorghe}, On three classes of automata-like P systems, 292-303 [Zbl 1037.68059] \textit{Giammarresi, Dora}, Computing languages by (bounded) local sets, 304-315 [Zbl 1037.68084] \textit{Harju, Tero; Nowotka, Dirk}, About Duval's conjecture, 316-324 [Zbl 1037.68104] \textit{Hemaspaandra, Lane A.; Mukherji, Proshanto; Tantau, Till}, Computation with absolutely no space overhead, 325-336 [Zbl 1037.68060] \textit{Hofbauer, Dieter; Waldmann, Johannes}, Deleting string rewriting systems preserve regularity, 337-348 [Zbl 1037.68069] \textit{Holzer, Markus; König, Barbara}, On deterministic finite automata and syntactic monoid size, continued, 349-360 [Zbl 1037.68098] \textit{Holzer, Markus; Kutrib, Martin}, Flip-pushdown automata: Nondeterminism is better than determinism, 361-372 [Zbl 1037.68085] \textit{Klimann, Ines; Lombardy, Sylvain; Mairesse, Jean; Prieur, Christophe}, Deciding the sequentiality of a finitely ambiguous max-plus automaton, 373-385 [Zbl 1037.68086] \textit{Malcher, Andreas}, Minimizing finite automata is computationally hard, 386-397 [Zbl 1037.68087] \textit{Okhotin, Alexander}, Boolean grammars, 398-410 [Zbl 1037.68071] \textit{Polák, Libor}, Syntactic semiring and universal automaton, 411-422 [Zbl 1037.68099] \textit{Rahonis, George}, Alphabetic pushdown tree transducers, 423-436 [Zbl 1037.68090]