LEADER 04935nam 22007575 450 001 996465599903316 005 20230406053022.0 010 $a1-280-38307-0 010 $a9786613560988 010 $a3-642-02737-7 024 7 $a10.1007/978-3-642-02737-6 035 $a(CKB)1000000000761234 035 $a(SSID)ssj0000317188 035 $a(PQKBManifestationID)11923522 035 $a(PQKBTitleCode)TC0000317188 035 $a(PQKBWorkID)10294280 035 $a(PQKB)10812689 035 $a(DE-He213)978-3-642-02737-6 035 $a(MiAaPQ)EBC3064331 035 $a(PPN)136307086 035 $a(EXLCZ)991000000000761234 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDevelopments in Language Theory$b[electronic resource] $e13th International Conference, DLT 2009, Stuttgart, Germany, June 30--July 3, 2009, Proceedings /$fedited by Volker Diekert, Dirk Nowotka 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XIII, 503 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5583 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-02736-9 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5583 606 $aMachine theory 606 $aComputer science 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aFormal Languages and Automata Theory 606 $aTheory of Computation 606 $aAlgorithms 606 $aMathematics of Computing 606 $aSymbolic and Algebraic Manipulation 606 $aDiscrete Mathematics in Computer Science 615 0$aMachine theory. 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aFormal Languages and Automata Theory. 615 24$aTheory of Computation. 615 24$aAlgorithms. 615 24$aMathematics of Computing. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aDiscrete Mathematics in Computer Science. 676 $a005.131 702 $aDiekert$b Volker$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aNowotka$b Dirk$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465599903316 996 $aDevelopments in Language Theory$9772277 997 $aUNISA