|
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465599903316 |
|
|
Titolo |
Developments in Language Theory [[electronic resource] ] : 13th International Conference, DLT 2009, Stuttgart, Germany, June 30--July 3, 2009, Proceedings / / edited by Volker Diekert, Dirk Nowotka |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
|
|
|
|
|
|
|
|
|
ISBN |
|
1-280-38307-0 |
9786613560988 |
3-642-02737-7 |
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2009.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIII, 503 p.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 5583 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Machine theory |
Computer science |
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Formal Languages and Automata Theory |
Theory of Computation |
Mathematics of Computing |
Symbolic and Algebraic Manipulation |
Discrete Mathematics in Computer Science |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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 -- Weighted Timed 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. |
|
|
|
|
|
| |