|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-642-02737-6 |
| 003 |
DE-He213 |
| 005 |
20230406053022.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2009 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642027376
|9 978-3-642-02737-6
|
| 024 |
7 |
|
|a 10.1007/978-3-642-02737-6
|2 doi
|
| 050 |
|
4 |
|a QA267-268.5
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a MAT018000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 005.131
|2 23
|
| 245 |
1 |
0 |
|a Developments in Language Theory
|h [electronic resource] :
|b 13th International Conference, DLT 2009, Stuttgart, Germany, June 30--July 3, 2009, Proceedings /
|c edited by Volker Diekert, Dirk Nowotka.
|
| 250 |
|
|
|a 1st ed. 2009.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2009.
|
| 300 |
|
|
|a XIII, 503 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 5583
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
1 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 700 |
1 |
|
|a Diekert, Volker.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Nowotka, Dirk.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642027383
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642027369
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 5583
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-02737-6
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
