This book constitutes the refereed proceedings of the 11th International Conference on Developments in Language Theory, DLT 2007, held in Turku, Finland in July 2007. It addresses all important issues in language theory including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; relationships to cryptography, concurrency, complexity theory and logic; bioinspired computing, and quantum computing.
This book constitutes the refereed proceedings of the 11th International Conference on Developments in Language Theory, DLT 2007, held in Turku, Finland in July 2007. It addresses all important issues in language theory including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; relationships to cryptography, concurrency, complexity theory and logic; bioinspired computing, and quantum computing.Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Produktdetails
Produktdetails
Theoretical Computer Science and General Issues 4588
Artikelnr. des Verlages: 12080298, 978-3-540-73207-5
2007
Seitenzahl: 440
Erscheinungstermin: 21. Juni 2007
Englisch
Abmessung: 235mm x 155mm x 24mm
Gewicht: 670g
ISBN-13: 9783540732075
ISBN-10: 3540732071
Artikelnr.: 22923569
Autorenporträt
Tero Harju, University of Turku, Finland / Juhani Karhumäki, University of Turku, Finland / Arto Lepistö, University of Turku, Finland
Inhaltsangabe
Invited Talks.- On First-Order Fragments for Words and Mazurkiewicz Traces.- Quantitative Generalizations of Languages.- What Do We Know About Language Equations?.- Information Distance and Applications.- Finite Automata and the Writing of Numbers.- Descriptional Complexity of Nondeterministic Finite Automata.- Contributed Papers.- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages.- Coding Partitions: Regularity, Maximality and Global Ambiguity.- Multi-letter Reversible and Quantum Finite Automata.- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids.- The Dynamics of Cellular Automata in Shift-Invariant Topologies.- Two Element Unavoidable Sets of Partial Words.- Hairpin Finite Automata.- Characterizing Reduction Graphs for Gene Assembly in Ciliates.- 2-Visibly Pushdown Automata.- An Efficient Computation of the Equation -Automaton of a Regular -Expression.- An Extension of Newton's Method to ?-Continuous Semirings.- Non-constructive Methods for Finite Probabilistic Automata.- The Unambiguity of Segmented Morphisms.- Commutation of Binary Factorial Languages.- Inapproximability of Nondeterministic State and Transition Complexity Assuming P???NP.- State Complexity of Union and Intersection of Finite Languages.- Bisimulation Minimisation for Weighted Tree Automata.- Conjunctive Grammars Can Generate Non-regular Unary Languages.- Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet.- Reduced Languages as ?-Generators.- Avoiding Approximate Squares.- Duplication Roots.- Complexity Theory for Splicing Systems.- Descriptional Complexity of Bounded Context-Free Languages.- Definable Transductions and Weighted Logics for Texts.- A Star Operation forStar-Free Trace Languages.- Finite Automata on Unranked and Unordered DAGs.- On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases.- A Local Balance Property of Episturmian Words.- Suffix Automata and Standard Sturmian Words.- Fine Hierarchy of Regular Aperiodic ?-Languages.- On Transition Minimality of Bideterministic Automata.
Invited Talks.- On First-Order Fragments for Words and Mazurkiewicz Traces.- Quantitative Generalizations of Languages.- What Do We Know About Language Equations?.- Information Distance and Applications.- Finite Automata and the Writing of Numbers.- Descriptional Complexity of Nondeterministic Finite Automata.- Contributed Papers.- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages.- Coding Partitions: Regularity, Maximality and Global Ambiguity.- Multi-letter Reversible and Quantum Finite Automata.- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids.- The Dynamics of Cellular Automata in Shift-Invariant Topologies.- Two Element Unavoidable Sets of Partial Words.- Hairpin Finite Automata.- Characterizing Reduction Graphs for Gene Assembly in Ciliates.- 2-Visibly Pushdown Automata.- An Efficient Computation of the Equation -Automaton of a Regular -Expression.- An Extension of Newton's Method to ?-Continuous Semirings.- Non-constructive Methods for Finite Probabilistic Automata.- The Unambiguity of Segmented Morphisms.- Commutation of Binary Factorial Languages.- Inapproximability of Nondeterministic State and Transition Complexity Assuming P???NP.- State Complexity of Union and Intersection of Finite Languages.- Bisimulation Minimisation for Weighted Tree Automata.- Conjunctive Grammars Can Generate Non-regular Unary Languages.- Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet.- Reduced Languages as ?-Generators.- Avoiding Approximate Squares.- Duplication Roots.- Complexity Theory for Splicing Systems.- Descriptional Complexity of Bounded Context-Free Languages.- Definable Transductions and Weighted Logics for Texts.- A Star Operation forStar-Free Trace Languages.- Finite Automata on Unranked and Unordered DAGs.- On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases.- A Local Balance Property of Episturmian Words.- Suffix Automata and Standard Sturmian Words.- Fine Hierarchy of Regular Aperiodic ?-Languages.- On Transition Minimality of Bideterministic Automata.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
