default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th DLT 2002: Kyoto, Japan
6. DLT 2002: Kyoto, Japan
- Masami Ito, Masafumi Toyama:
Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers. Lecture Notes in Computer Science 2450, Springer 2003, ISBN 3-540-40431-7 - Tero Harju
, Grzegorz Rozenberg:
Computational Processes in Living Cells: Gene Assembly in Ciliates. 1-20 - Masahiro Kitagawa:
Experimental Quantum Computation with Molecules. 21-27 - Sebastian Seibert:
Efficient Transformations from Regular Expressions to Finite Automata. 28-42 - Zoltán Ésik:
Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators. 43-58 - Volker Diekert, Manfred Kufleitner:
A Remark about Quadratic Trace Equations. 59-66 - Jarkko Kari:
Infinite Snake Tiling Problems. 67-77 - Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
Decision Problems for Linear and Circular Splicing Systems. 78-92 - Karl Svozil:
Finite Automata Models of Quantized Systems: Conceptual Status and Outlook. 93-102 - Véronique Bruyère, Olivier Carton:
Automata on Linear Orderings. 103-115 - Mark Daley, Lila Kari:
Some Properties of Ciliate Bio-operations. 116-127 - Jürgen Dassow, Taishin Y. Nishida, Bernd Reichel:
On the Descriptional Complexity of Some Variants of Lindenmayer Systems. 128-139 - Hendrik Jan Hoogeboom:
Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata. 140-151 - Henry N. Adorna:
On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities. 152-161 - Markus Holzer, Martin Kutrib:
Unary Language Operations and Their Nondeterministic State Complexity. 162-172 - Julien Cassaigne:
Constructing Infinite Words of Intermediate Complexity. 173-184 - Yuji Sasaki, Katsushi Inoue, Akira Ito, Yue Wang:
A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines. 185-196 - Jirí Srba:
Undecidability of Weak Bisimilarity for PA-Processes. 197-208 - Michael Domaratzki:
Improved Bounds on the Number of Automata Accepting Finite Languages. 209-219 - Sándor Horváth, Peter Leupold, Gerhard Lischke:
Roots and Powers of Regular Languages. 220-230 - Jürgen Giesl, Aart Middeldorp:
Innermost Termination of Context-Sensitive Rewriting. 231-244 - Stepan Holub:
A Unique Structure of Two-Generated Binary Equality Sets. 245-257 - Markus Holzer, Barbara König:
On Deterministic Finite Automata and Syntactic Monoid Size. 258-269 - Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov:
An Inverse Automata Algorithm for Recognizing 2-Collapsing Words. 270-282 - Kostyantyn Archangelsky:
Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Sigma*-Automata. 283-289 - Balázs Imreh:
Some Remarks on Asynchronous Automata. 290-296 - Jan-Henrik Altenbernd, Wolfgang Thomas, Stefan Wöhrle:
Tiling Systems over Infinite Pictures and Their Acceptance Conditions. 297-306 - Frédérique Bassino, Julien Clément, Cyril Nicaud:
The Average Lengths of the Factors of the Standard Factorization of Lyndon Words. 307-318 - James D. Currie, D. Sean Fitzpatrick:
Circular Words Avoiding Patterns. 319-325 - Oscar H. Ibarra, Zhe Dang, Zhi-Wei Sun:
Safety Verification for Two-Way Finite Automata with Monotonic Counters. 326-338 - Hiroshi Umeo, Naoki Kamikawa:
An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton. 339-348 - László Kászonyi:
On the Structure of Graphic DLI-Sets. 349-356 - Nguyen Huong Lam:
Finite Completion of Comma-Free Codes. Part I. 357-368 - Do Long Van, Igor Litovsky:
On a Family of Codes with Bounded Deciphering Delay. 369-380 - Tanguy Urvoy:
Abstract Families of Graphs. 381-392 - Alexander Okhotin:
Automaton Representation of Linear Conjunctive Languages. 393-404 - Christiane Frougny:
On-Line Odometers for Two-Sided Symbolic Dynamical Systems. 405-416 - Tatjana Petkovic, Miroslav Ciric, Stojan Bogdanovic:
Characteristic Semigroups of Directable Automata. 417-427
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-02-11 23:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
