000 05670nam a22006015i 4500
001 978-3-540-85780-8
003 DE-He213
005 20240730194113.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540857808
_9978-3-540-85780-8
024 7 _a10.1007/978-3-540-85780-8
_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] :
_b12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008, Proceedings /
_cedited by Masami Ito, Masafumi Toyama.
250 _a1st ed. 2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2008.
300 _aXIII, 544 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 ;
_v5257
505 0 _aInvited Talks -- Iteration Semirings -- Various Aspects of Finite Quantum Automata -- On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes -- Selected Ideas Used for Decidability and Undecidability of Bisimilarity -- The Frobenius Problem and Its Generalizations -- Well Quasi-orders in Formal Language Theory -- Contributed Papers -- On the Non-deterministic Communication Complexity of Regular Languages -- General Algorithms for Testing the Ambiguity of Finite Automata -- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete -- The Average State Complexity of the Star of a Finite Set of Words Is Linear -- On the Computational Capacity of Parallel Communicating Finite Automata -- On a Generalization of Standard Episturmian Morphisms -- Universal Recursively Enumerable Sets of Strings -- Algorithmically Independent Sequences -- Relationally Periodic Sequences and Subword Complexity -- Bounds on Powers in Strings -- When Is Reachability Intrinsically Decidable? -- Some New Modes of Competence-Based Derivations in CD Grammar Systems -- The Synchronization Problem for Strongly Transitive Automata -- On the Decidability of the Equivalence for k-Valued Transducers -- Decidable Properties of 2D Cellular Automata -- Fixed Point and Aperiodic Tilings -- Extended Multi Bottom-Up Tree Transducers -- Derivation Tree Analysis for Accelerated Fixed-Point Computation -- Tree Automata with Global Constraints -- Bad News on Decision Problems for Patterns -- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time -- More Concise Representation of Regular Languages by Automata and Regular Expressions -- A Taxonomy of Deterministic Forgetting Automata -- Provably Shorter Regular Expressions from Deterministic Finite Automata -- Large Simple Binary EqualityWords -- On the Relation between Periodicity and Unbordered Factors of Finite Words -- Duplication in DNA Sequences -- On the State Complexity of Complements, Stars, and Reversals of Regular Languages -- On the State Complexity of Operations on Two-Way Finite Automata -- On the Size Complexity of Rotating and Sweeping Automata -- An Analysis and a Reproof of Hmelevskii's Theorem -- Hierarchies of Piecewise Testable Languages -- Construction of Tree Automata from Regular Expressions -- Balance Properties and Distribution of Squares in Circular Words -- MSO Logic for Unambiguous Shared-Memory Systems -- Complexity of Topological Properties of Regular ?-Languages.
520 _aThis book constitutes the refereed proceedings of the 12th International Conference on Developments in Language Theory, DLT 2008, held in Kyoto, Japan, September 2008. The 36 revised full papers presented together with 6 invited papers were carefully reviewed and selected from 102 submissions. All important issues in language theory are addressed including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; algorithmic, combinatorial and algebraic properties of words and languages; variable length codes; symbolic dynamics; cellular automata; polyominoes and multidimensional patterns; decidability questions; image manipulation and compression; efficient text algorithms; relationships to cryptography, concurrency, complexity theory and logic; bio-inspired computing; quantum computing.
650 0 _aMachine theory.
_9155740
650 0 _aComputer science.
_99832
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aFormal Languages and Automata Theory.
_9155741
650 2 4 _aTheory of Computation.
_9155742
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aSymbolic and Algebraic Manipulation.
_955589
700 1 _aIto, Masami.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9155743
700 1 _aToyama, Masafumi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9155744
710 2 _aSpringerLink (Online service)
_9155745
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540857792
776 0 8 _iPrinted edition:
_z9783540858133
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5257
_9155746
856 4 0 _uhttps://doi.org/10.1007/978-3-540-85780-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95028
_d95028