Developments in Language Theory 5th International Conference, DLT 2001, Vienna, Austria, July 16-21, 2001. Revised Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Kuich, Werner (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Rozenberg, Grzegorz (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Salomaa, Arto (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
• Έκδοση: 1st ed. 2002.
• Σειρά: Lecture Notes in Computer Science, 2295
• Θέματα: Programming languages (Electronic computers).; Mathematical logic.; Computers.; Computer logic.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Foundations.; Theory of Computation.; Mathematical Logic and Formal Languages.; Computation by Abstract Devices.; Logics and Meanings of Programs.

 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 Information Communication -- Eliminating Communication by Parallel Rewriting -- String Rewriting Sequential P-Systems and Regulated Rewriting.