LEADER 05371nam 22007335 450 001 996465440103316 005 20200703194158.0 010 $a3-540-45005-X 024 7 $a10.1007/3-540-45005-X 035 $a(CKB)1000000000211839 035 $a(SSID)ssj0000322562 035 $a(PQKBManifestationID)11247831 035 $a(PQKBTitleCode)TC0000322562 035 $a(PQKBWorkID)10287590 035 $a(PQKB)10602529 035 $a(DE-He213)978-3-540-45005-4 035 $a(MiAaPQ)EBC3072070 035 $a(PPN)15517729X 035 $a(EXLCZ)991000000000211839 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDevelopments in Language Theory$b[electronic resource] $e6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers /$fedited by Masami Ito, Masafumi Toyama 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (X, 438 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2450 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-40431-7 320 $aIncludes bibliographical references and index. 327 $aInvited Presentations -- Computational Processes in Living Cells: Gene Assembly in Ciliates -- Experimental Quantum Computation with Molecules -- Efficient Transformations from Regular Expressions to Finite Automata -- Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators -- A Remark about Quadratic Trace Equations -- Infinite Snake Tiling Problems -- Decision Problems for Linear and Circular Splicing Systems -- Finite Automata Models of Quantized Systems: Conceptual Status and Outlook -- Automata on Linear Orderings -- Contributions -- Some Properties of Ciliate Bio-operations -- On the Descriptional Complexity of Some Variants of Lindenmayer Systems -- Carriers and Counters -- On the Separation between k-Party and (k - 1)-Party Nondeterministic Message Complexities -- Unary Language Operations and Their Nondeterministic State Complexity -- Constructing Infinite Words of Intermediate Complexity -- A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines -- Undecidability of Weak Bisimilarity for PA-Processes -- Improved Bounds on the Number of Automata Accepting Finite Languages -- Roots and Powers of Regular Languages -- Innermost Termination of Context-Sensitive Rewriting -- A Unique Structure of Two-Generated Binary Equality Sets -- On Deterministic Finite Automata and Syntactic Monoid Size -- An Inverse Automata Algorithm for Recognizing 2-Collapsing Words -- Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z - ?*-Automata -- Some Remarks on Asynchronous Automata -- Tiling Systems over Infinite Pictures and Their Acceptance Conditions -- The Average Lengths of the Factors of the Standard Factorization of Lyndon Words -- Circular Words Avoiding Patterns -- Safety Verification for Two-Way Finite Automata with Monotonic Counters -- An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton -- On the Structure of Graphic DLI-Sets -- Finite Completion of Comma-Free Codes. Part I -- On a Family of Codes with Bounded Deciphering Delay -- Abstract Families of Graphs -- Automaton Representation of Linear Conjunctive Languages -- On-Line Odometers for Two-Sided Symbolic Dynamical Systems -- Characteristic Semigroups of Directable Automata. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2450 606 $aMathematical logic 606 $aComputers 606 $aComputer logic 606 $aComputer science?Mathematics 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aScience, Humanities and Social Sciences, multidisciplinary$3https://scigraph.springernature.com/ontologies/product-market-codes/A11007 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 615 0$aMathematical logic. 615 0$aComputers. 615 0$aComputer logic. 615 0$aComputer science?Mathematics. 615 14$aMathematical Logic and Formal Languages. 615 24$aScience, Humanities and Social Sciences, multidisciplinary. 615 24$aComputation by Abstract Devices. 615 24$aLogics and Meanings of Programs. 615 24$aDiscrete Mathematics in Computer Science. 676 $a511.3 702 $aIto$b Masami$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aToyama$b Masafumi$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aConference on Developments in Language Theory 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465440103316 996 $aDevelopments in Language Theory$9772277 997 $aUNISA