Developments in Language Theory : 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007. Proceedings / edited by Tero Harju, Juhani Karhumäki, Arto Lepistö

Mitwirkende(r):

Resource type: Ressourcentyp: Buch (Online)Buch (Online)Sprache: Englisch Reihen: SpringerLink Bücher | Lecture notes in computer science ; 4588Verlag: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Beschreibung: Online-Ressource (XI, 423 p. Also available online, digital)ISBN:

9783540732082

Schlagwörter:

Genre/Form:

Konferenzschrift -- 2007 -- Turku

Andere physische Formen: 9783540732075 | Buchausg. u.d.T.: Developments in language theory. Berlin : Springer, 2007. XI, 421 S.DDC-Klassifikation:

005.13/1
005.131
Z
004 Z

MSC: MSC: *68-06 | 68Q45 | 00B25LOC-Klassifikation:

QA8.9-QA10.3
QA267.3

DOI: DOI: 10.1007/978-3-540-73208-2Online-Ressourcen:

Zugang im Netz des KIT

Zusammenfassung: 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 for Star-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.PPN: PPN: 1646882326Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB | ZDB-2-LNC

Exemplare ( 0 )

Dieser Titel hat keine Exemplare