ISBN: 9783540434535 - developments in language theory: 5th international conference, dlt 2001, vienna, austria, july 16-21, 2001. revised papers (lecture notes in computer science, 2295, band 2295) (4 Ergebnisse)

Zustand: Very Good. 1st Edition. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. …

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…