Werner Kuich / Grzegorz Rozenberg / Arto Salomaa (eds.)

Developments in Language Theory

5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001. Revised Papers
Herausgegeben:Kuich, Werner; Rozenberg, Grzegorz; Salomaa, Arto

• Broschiertes Buch

Produktbeschreibung

DLT 2001 was the ?fth Conference on Developments in Language Theory. It was a broadly based conference covering all aspects of Language Theory: grammars and - ceptorsforstrings,graphs,arrays,etc. ;ef?cientalgorithmsforlanguages;combinatorial andalgebraicpropertiesoflanguages;decisionproblems;relationstocomplexitytheory; logic; picture description and analysis; DNA computing; cryptography; concurrency. DLT 2001 was held at Technische Universitat Wien from July 16 to July 21, 2001. The OrganizingCommitteeconsistedofRudolfFreund,WernerKuich(chairman),Christiane Nikoll, Margarethe Soukup, Friedrich Urbanek. Previous DLTs were held in Turku (1993), Magdeburg (1995), Thessalonike (1997), Aachen (1999). The Program Committee of DLT 2001 consisted of Christian Choffrut (Paris), J urgen Dassow (Magdeburg), Masami Ito (Kyoto), Werner Kuich (Wien, chairman),GiancarloMauri(Milano),GheorghePaun ? (Bucuresti), GrzegorzRozenberg (Leiden), Arto Salomaa (Turku), Wolfgang Thomas (Aachen). It selected 24 papers from 64 papers submitted in response to the call for papers. These papers came from the following countries: Australia, Austria, Belgium, Brazil, Bulgaria, Canada, Czech Republic, Estonia, Finland, France, Germany, Hungary, India, Italy, Japan, Moldova, The Netherlands, Phillipines, Poland, Romania, Russia, Slovakia, Spain, United Kingdom, USA. Each submitted paper was evaluated by at least four members of the Program Committee. Together with 10 invited presentations all 24 selected papers are contained in this volume. The papers in this volume are printed according to the order of presentation at DLT 2001 and thus grouped into sessions, most of which are thematic. It is a pleasure for the editors to thank the members of the Program Committee for the evaluation of the papers, and the many referees who assisted in this process.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 2295
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 10846416, 978-3-540-43453-5
• 2002
• Seitenzahl: 404
• Erscheinungstermin: 27. März 2002
• Englisch
• Abmessung: 235mm x 155mm x 22mm
• Gewicht: 572g
• ISBN-13: 9783540434535
• ISBN-10: 3540434534
• Artikelnr.: 23347114

Autorenporträt

Werner Kuich, Technische Universität Wien, Austria / Grzegorz Rozenberg, University of Leiden, The Netherlands / Arto Salomaa, Turku Centre for Computer Science, Turku, Finland

Inhaltsangabe

Invited Presentations.- Automata: From Uncertainty to Quantum.- Elementary Theory of Ordinals with Addition and Left Translation by ?.- The Equational Theory of Fixed Points with Applications to Generalized Language Theory.- Second-Order Logic over Strings: Regular and Non-regular Fragments.- Decision Questions on Integer Matrices.- Some Petri Net Languages and Codes.- Words, Permutations, and Representations of Numbers.- Proof Complexity of Pigeonhole Principles.- Words and Patterns.- A Short Introduction to Infinite Automata.- Contributions.- The Power of One-Letter Rational Languages.- The Entropy of Lukasiewicz-Languages.- Collapsing Words vs. Synchronizing Words.- A Note on Synchronized Automata and Road Coloring Problem.- Shuffle Quotient and Decompositions.- The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages.- Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable.- Automata on Series-Parallel Biposets.- Hierarchies of String Languages Generated by Deterministic Tree Transducers.- Partially-Ordered Two-Way Automata: A New Characterization of DA.- Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets.- On the Power of Randomized Pushdown Automata.- The Root of a Language and Its Complexity.- Valuated and Valence Grammars: An Algebraic View.- Context-Free Valence Grammars - Revisited.- An Undecidability Result Concerning Periodic Morphisms.- A Universal Turing Machine with 3 States and 9 Symbols.- Minimal Covers of Formal Languages.- Some Regular Languages That Are Church-Rosser Congruential.- On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy.- Forbidden Factors and Fragment Assembly.- Parallel Communicating Grammar Systems with Incomplete InformationCommunication.- Eliminating Communication by Parallel Rewriting.- String Rewriting Sequential P-Systems and Regulated Rewriting.