LEADER 04934nam  22007815  450 
001 996466116203316
005 20230221160158.0
010   $a3-540-73208-X
024 7 $a10.1007/978-3-540-73208-2
035   $a(CKB)1000000000490503
035   $a(SSID)ssj0000317186
035   $a(PQKBManifestationID)11222219
035   $a(PQKBTitleCode)TC0000317186
035   $a(PQKBWorkID)10294279
035   $a(PQKB)11246518
035   $a(DE-He213)978-3-540-73208-2
035   $a(MiAaPQ)EBC3063321
035   $a(MiAaPQ)EBC6711199
035   $a(Au-PeEL)EBL6711199
035   $a(OCoLC)184905847
035   $a(PPN)123163145
035   $a(EXLCZ)991000000000490503
100   $a20100301d2007      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aDevelopments in Language Theory$b[electronic resource] $e11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings /$fedited by Tero Harju, Juhani Karhumäki, Arto Lepistö
205   $a1st ed. 2007.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007.
215   $a1 online resource (XI, 428 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4588
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-73207-1 
320   $aIncludes bibliographical references and index.
327   $aInvited Talks -- On First-Order Fragments for Words and Mazurkiewicz Traces -- Quantitative Generalizations of Languages -- What Do We Know About Language Equations? -- Information Distance and Applications -- Finite Automata and the Writing of Numbers -- Descriptional Complexity of Nondeterministic Finite Automata -- Contributed Papers -- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages -- Coding Partitions: Regularity, Maximality and Global Ambiguity -- Multi-letter Reversible and Quantum Finite Automata -- Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids -- The Dynamics of Cellular Automata in Shift-Invariant Topologies -- Two Element Unavoidable Sets of Partial Words -- Hairpin Finite Automata -- Characterizing Reduction Graphs for Gene Assembly in Ciliates -- 2-Visibly Pushdown Automata -- An Efficient Computation of the Equation -Automaton of a Regular -Expression -- An Extension of Newton?s Method to ?-Continuous Semirings -- Non-constructive Methods for Finite Probabilistic Automata -- The Unambiguity of Segmented Morphisms -- Commutation of Binary Factorial Languages -- Inapproximability of Nondeterministic State and Transition Complexity Assuming P???NP -- State Complexity of Union and Intersection of Finite Languages -- Bisimulation Minimisation for Weighted Tree Automata -- Conjunctive Grammars Can Generate Non-regular Unary Languages -- Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet -- Reduced Languages as ?-Generators -- Avoiding Approximate Squares -- Duplication Roots -- Complexity Theory for Splicing Systems -- Descriptional Complexity of Bounded Context-Free Languages -- Definable Transductions and Weighted Logics for Texts -- A Star Operation for Star-Free Trace Languages -- Finite Automata on Unranked and Unordered DAGs -- On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases -- A Local Balance Property of Episturmian Words -- Suffix Automata and Standard Sturmian Words -- Fine Hierarchy of Regular Aperiodic ?-Languages -- On Transition Minimality of Bideterministic Automata.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4588
606   $aMachine theory
606   $aComputer science
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aFormal Languages and Automata Theory
606   $aTheory of Computation
606   $aComputer Science Logic and Foundations of Programming
606   $aDiscrete Mathematics in Computer Science
606   $aSymbolic and Algebraic Manipulation
615  0$aMachine theory.
615  0$aComputer science.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615 14$aFormal Languages and Automata Theory.
615 24$aTheory of Computation.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aSymbolic and Algebraic Manipulation.
676   $a005.131
702   $aHarju$b T.
702   $aKarhuma?ki$b Juhani
702   $aLepisto?$b Arto
712 12$aConference on Developments in Language Theory
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a996466116203316
996   $aDevelopments in Language Theory$9772277
997   $aUNISA