|
|
|
|
LEADER |
04286nam a22005535i 4500 |
001 |
978-3-642-02737-6 |
003 |
DE-He213 |
005 |
20170118230348.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
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA8.9-QA10.3
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a MAT018000
|2 bisacsh
|
072 |
|
7 |
|a COM051010
|2 bisacsh
|
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.
|
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 Lecture Notes in Computer Science,
|x 0302-9743 ;
|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 Computer science.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
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.
|
700 |
1 |
|
|a Nowotka, Dirk.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642027369
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5583
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-02737-6
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|