6. DLT 2002:
Kyoto,
Japan
6. DLT 2002:
Kyoto,
Japan
Masami Ito, Masafumi Toyama (Eds.):
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 BibTeX
@proceedings{DBLP:conf/dlt/2002,
editor = {Masami Ito and
Masafumi Toyama},
title = {Developments in Language Theory, 6th International Conference,
DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers},
booktitle = {Developments in Language Theory},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2450},
year = {2003},
isbn = {3-540-40431-7},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Tero Harju, Grzegorz Rozenberg:
Computational Processes in Living Cells: Gene Assembly in Ciliates.
1-20
Electronic Edition (link) BibTeX
- Masahiro Kitagawa:
Experimental Quantum Computation with Molecules.
21-27
Electronic Edition (link) BibTeX
- Sebastian Seibert:
Efficient Transformations from Regular Expressions to Finite Automata.
28-42
Electronic Edition (link) BibTeX
- Zoltán Ésik:
Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators.
43-58
Electronic Edition (link) BibTeX
- Volker Diekert, Manfred Kufleitner:
A Remark about Quadratic Trace Equations.
59-66
Electronic Edition (link) BibTeX
- Jarkko Kari:
Infinite Snake Tiling Problems.
67-77
Electronic Edition (link) BibTeX
- Paola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza:
Decision Problems for Linear and Circular Splicing Systems.
78-92
Electronic Edition (link) BibTeX
- Karl Svozil:
Finite Automata Models of Quantized Systems: Conceptual Status and Outlook.
93-102
Electronic Edition (link) BibTeX
- Véronique Bruyère, Olivier Carton:
Automata on Linear Orderings.
103-115
Electronic Edition (link) BibTeX
- Mark Daley, Lila Kari:
Some Properties of Ciliate Bio-operations.
116-127
Electronic Edition (link) BibTeX
- Jürgen Dassow, Taishin Y. Nishida, Bernd Reichel:
On the Descriptional Complexity of Some Variants of Lindenmayer Systems.
128-139
Electronic Edition (link) BibTeX
- Hendrik Jan Hoogeboom:
Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata.
140-151
Electronic Edition (link) BibTeX
- Henry N. Adorna:
On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities.
152-161
Electronic Edition (link) BibTeX
- Markus Holzer, Martin Kutrib:
Unary Language Operations and Their Nondeterministic State Complexity.
162-172
Electronic Edition (link) BibTeX
- Julien Cassaigne:
Constructing Infinite Words of Intermediate Complexity.
173-184
Electronic Edition (link) BibTeX
- Yuji Sasaki, Katsushi Inoue, Akira Ito, Yue Wang:
A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines.
185-196
Electronic Edition (link) BibTeX
- Jirí Srba:
Undecidability of Weak Bisimilarity for PA-Processes.
197-208
Electronic Edition (link) BibTeX
- Michael Domaratzki:
Improved Bounds on the Number of Automata Accepting Finite Languages.
209-219
Electronic Edition (link) BibTeX
- Sándor Horváth, Peter Leupold, Gerhard Lischke:
Roots and Powers of Regular Languages.
220-230
Electronic Edition (link) BibTeX
- Jürgen Giesl, Aart Middeldorp:
Innermost Termination of Context-Sensitive Rewriting.
231-244
Electronic Edition (link) BibTeX
- Stepan Holub:
A Unique Structure of Two-Generated Binary Equality Sets.
245-257
Electronic Edition (link) BibTeX
- Markus Holzer, Barbara König:
On Deterministic Finite Automata and Syntactic Monoid Size.
258-269
Electronic Edition (link) BibTeX
- Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov:
An Inverse Automata Algorithm for Recognizing 2-Collapsing Words.
270-282
Electronic Edition (link) BibTeX
- Kostyantyn Archangelsky:
Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Sigma*-Automata.
283-289
Electronic Edition (link) BibTeX
- Balázs Imreh:
Some Remarks on Asynchronous Automata.
290-296
Electronic Edition (link) BibTeX
- Jan-Henrik Altenbernd, Wolfgang Thomas, Stefan Wöhrle:
Tiling Systems over Infinite Pictures and Their Acceptance Conditions.
297-306
Electronic Edition (link) BibTeX
- Frédérique Bassino, Julien Clément, Cyril Nicaud:
The Average Lengths of the Factors of the Standard Factorization of Lyndon Words.
307-318
Electronic Edition (link) BibTeX
- James D. Currie, D. Sean Fitzpatrick:
Circular Words Avoiding Patterns.
319-325
Electronic Edition (link) BibTeX
- Oscar H. Ibarra, Zhe Dang, Zhi-Wei Sun:
Safety Verification for Two-Way Finite Automata with Monotonic Counters.
326-338
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- László Kászonyi:
On the Structure of Graphic DLI-Sets.
349-356
Electronic Edition (link) BibTeX
- Nguyen Huong Lam:
Finite Completion of Comma-Free Codes. Part I.
357-368
Electronic Edition (link) BibTeX
- Do Long Van, Igor Litovsky:
On a Family of Codes with Bounded Deciphering Delay.
369-380
Electronic Edition (link) BibTeX
- Tanguy Urvoy:
Abstract Families of Graphs.
381-392
Electronic Edition (link) BibTeX
- Alexander Okhotin:
Automaton Representation of Linear Conjunctive Languages.
393-404
Electronic Edition (link) BibTeX
- Christiane Frougny:
On-Line Odometers for Two-Sided Symbolic Dynamical Systems.
405-416
Electronic Edition (link) BibTeX
- Tatjana Petkovic, Miroslav Ciric, Stojan Bogdanovic:
Characteristic Semigroups of Directable Automata.
417-427
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:07:10 2009
by Michael Ley (ley@uni-trier.de)