05371nam 22007335 450 99646544010331620200703194158.03-540-45005-X10.1007/3-540-45005-X(CKB)1000000000211839(SSID)ssj0000322562(PQKBManifestationID)11247831(PQKBTitleCode)TC0000322562(PQKBWorkID)10287590(PQKB)10602529(DE-He213)978-3-540-45005-4(MiAaPQ)EBC3072070(PPN)15517729X(EXLCZ)99100000000021183920121227d2003 u| 0engurnn|008mamaatxtccrDevelopments in Language Theory[electronic resource] 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers /edited by Masami Ito, Masafumi Toyama1st ed. 2003.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2003.1 online resource (X, 438 p.) Lecture Notes in Computer Science,0302-9743 ;2450Bibliographic Level Mode of Issuance: Monograph3-540-40431-7 Includes bibliographical references and index.Invited 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.Lecture Notes in Computer Science,0302-9743 ;2450Mathematical logicComputersComputer logicComputer science—MathematicsMathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Science, Humanities and Social Sciences, multidisciplinaryhttps://scigraph.springernature.com/ontologies/product-market-codes/A11007Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XDiscrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Mathematical logic.Computers.Computer logic.Computer science—Mathematics.Mathematical Logic and Formal Languages.Science, Humanities and Social Sciences, multidisciplinary.Computation by Abstract Devices.Logics and Meanings of Programs.Discrete Mathematics in Computer Science.511.3Ito Masamiedthttp://id.loc.gov/vocabulary/relators/edtToyama Masafumiedthttp://id.loc.gov/vocabulary/relators/edtConference on Developments in Language TheoryMiAaPQMiAaPQMiAaPQBOOK996465440103316Developments in Language Theory772277UNISA