Developments in Language Theory: 13th International Conference, D.L.T. 2009, Stuttgart, Germany, June 30-July 3, 2009, Proceedings (Lecture Notes in . ... Notes in Computer Science, 5583, Band 5583) - Taschenbuch

EAN (ISBN-13): 9783642027369
ISBN (ISBN-10): 3642027369
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2009
Herausgeber: Springer Berlin
501 Seiten
Gewicht: 0,782 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-11-11T03:47:53+01:00 (Berlin)
Detailseite zuletzt geändert am 2024-03-10T17:37:09+01:00 (Berlin)
ISBN/EAN: 9783642027369

ISBN - alternative Schreibweisen:
3-642-02736-9, 978-3-642-02736-9
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: mazower, völker, barbara paul, europe 1997, diekert
Titel des Buches: stuttgart, july, conference proceedings, lecture notes computer science, first over germany, what with germany, dlt, language

---

Daten vom Verlag:

Autor/in: Volker Diekert; Dirk Nowotka
Titel: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Developments in Language Theory - 13th International Conference, DLT 2009, Stuttgart, Germany, June 30--July 3, 2009, Proceedings
Verlag: Springer; Springer Berlin
503 Seiten
Erscheinungsjahr: 2009-06-22
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIII, 503 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Informatik; Alphabet; Erfüllbarkeitsproblem der Aussagenlogik; Kuratowski; Variable; automata; automata theory; boolean satisfiability problem; complexity; computability; formal language; formal languages; grammars; logic; petri net; regular expressions; algorithm analysis and problem complexity; Formal Languages and Automata Theory; Theory of Computation; Algorithms; Mathematics of Computing; Symbolic and Algebraic Manipulation; Discrete Mathematics in Computer Science; Algorithmen und Datenstrukturen; Mathematik für Informatiker; Diskrete Mathematik; EA

Invited Talks.- Factorization Forests.- Weighted versus Probabilistic Logics.- Post Correspondence Problem and Small Dimensional Matrices.- Size Complexity of Two-Way Finite Automata.- Matrix Mortality and the ?erný-Pin Conjecture.- Regular Papers.- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata.- Regular Languages Definable by Majority Quantifiers with Two Variables.- The Inclusion Problem of Context-Free Languages: Some Tractable Cases.- On the Complexity of Deciding Avoidability of Sets of Partial Words.- Closures in Formal Languages and Kuratowski’s Theorem.- Rich and Periodic-Like Words.- Traces of Control-Flow Graphs.- Left and Right Synchronous Relations.- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words.- Asymptotic Cellular Complexity.- Strongly Regular Grammars and Regular Approximation of Context-Free Languages.- Powers of Regular Languages.- Existence and Nonexistence of Descriptive Patterns.- On Stateless Multihead Finite Automata and Multihead Pushdown Automata.- On Negative Bases.- Crucial Words for Abelian Powers.- Tight Bounds on the Descriptional Complexity of Regular Expressions.- Subshifts, Languages and Logic.- Magic Numbers and Ternary Alphabet.- The Pumping Lemma for Well-Nested Multiple Context-Free Languages.- The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable.- A Game-Theoretic Characterization of Boolean Grammars.- Word Equations with One Unknown.- On Equations over Sets of Numbers and Their Limitations.- Some Remarks on Superposition Based on Watson-Crick-Like Complementarity.- A Weighted ?-Calculus on Words.- Branching-Time Temporal Logics with Minimal Model Quantifiers.- Simulations by Time-Bounded Counter Machines.- WeightedTimed MSO Logics.- Balanced Words Having Simple Burrows-Wheeler Transform.- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations.- Definability in the Infix Order on Words.- Two-Sided Bounds for the Growth Rates of Power-Free Languages.- On the Decidability of the Equivalence for a Certain Class of Transducers.- Erasing in Petri Net Languages and Matrix Grammars.