LEADER 04280nam 2200601Ia 450 001 9910484925903321 005 20200520144314.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 $a20090703d2009 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDevelopments in language theory $e13th international conference, DLT 2009, Stuttgart, Germany, June 30-July 3, 2009 : proceedings /$fVolker Diekert, Dirk Nowotka, eds 205 $a1st ed. 2009. 210 $aBerlin ;$aNew York $cSpringer$dc2009 215 $a1 online resource (XIII, 503 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v5583 225 1 $aLNCS sublibrary.$aSL 1,$aTheoretical computer science and general issues 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$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 410 0$aLecture notes in computer science ;$v5583. 606 $aComputational linguistics$vCongresses 606 $aFormal languages$vCongresses 615 0$aComputational linguistics 615 0$aFormal languages 676 $a005.131 701 $aDiekert$b Volker$f1955-$01220869 701 $aNowotka$b Dirk$01761696 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484925903321 996 $aDevelopments in language theory$94201295 997 $aUNINA