000 04611nam a22005895i 4500
001 978-3-540-73208-2
003 DE-He213
005 20240730191002.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540732082
_9978-3-540-73208-2
024 7 _a10.1007/978-3-540-73208-2
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aDevelopments in Language Theory
_h[electronic resource] :
_b11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings /
_cedited by Tero Harju, Juhani Karhumäki, Arto Lepistö.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXI, 428 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4588
505 0 _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 forStar-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.
650 0 _aMachine theory.
_9144727
650 0 _aComputer science.
_99832
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aFormal Languages and Automata Theory.
_9144728
650 2 4 _aTheory of Computation.
_9144729
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
700 1 _aHarju, Tero.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9144730
700 1 _aKarhumäki, Juhani.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9144731
700 1 _aLepistö, Arto.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9144732
710 2 _aSpringerLink (Online service)
_9144733
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540732075
776 0 8 _iPrinted edition:
_z9783540839859
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4588
_9144734
856 4 0 _uhttps://doi.org/10.1007/978-3-540-73208-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93557
_d93557