Masami Ito, Masafumi Toyama
Revised Papers of the Seventh International Conference on Developments in Language Theory
DLT, 2002.

@proceedings{DLT-2002,
	address       = "Kyoto, Japan",
	editor        = "Masami Ito and Masafumi Toyama",
	isbn          = "3-540-40431-7",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Papers of the Seventh International Conference on Developments in Language Theory}",
	volume        = 2450,
	year          = 2002,
}

Contents (37 items)

12 ×#automaton
8 ×#finite
5 ×#on the
5 ×#word
4 ×#infinity
3 ×#bound
3 ×#complexity
3 ×#linear
2 ×#algorithm
2 ×#monad

DLT-2002-HarjuR #assembly #process

Computational Processes in Living Cells: Gene Assembly in Ciliates (TH, GR), pp. 1–20.

DLT-2002-Kitagawa #quantum

Experimental Quantum Computation with Molecules (MK), pp. 21–27.

DLT-2002-Seibert #automaton #finite #performance #regular expression

Efficient Transformations from Regular Expressions to Finite Automata (SS), pp. 28–42.

DLT-2002-Esik #finite #generative #logic #monad #word

Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators (ZÉ), pp. 43–58.

DLT-2002-DiekertK #equation #polynomial

A Remark about Quadratic Trace Equations (VD, MK), pp. 59–66.

DLT-2002-Kari #infinity #problem

Infinite Snake Tiling Problems (JK), pp. 67–77.

DLT-2002-BonizzoniFMZ #linear #problem

Decision Problems for Linear and Circular Splicing Systems (PB, CdF, GM, RZ), pp. 78–92.

DLT-2002-Svozil #automaton #concept #finite #modelling

Finite Automata Models of Quantized Systems: Conceptual Status and Outlook (KS), pp. 93–102.

DLT-2002-BruyereC #automaton #linear #order

Automata on Linear Orderings (VB, OC), pp. 103–115.

DLT-2002-DaleyK

Some Properties of Ciliate Bio-operations (MD, LK), pp. 116–127.

DLT-2002-DassowNR #complexity #on the

On the Descriptional Complexity of Some Variants of Lindenmayer Systems (JD, TYN, BR), pp. 128–139.

DLT-2002-Hoogeboom #automaton

Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata (HJH), pp. 140–151.

DLT-2002-Adorna #nondeterminism #on the

On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities (HNA), pp. 152–161.

DLT-2002-HolzerK #complexity #nondeterminism

Unary Language Operations and Their Nondeterministic State Complexity (MH, MK), pp. 162–172.

DLT-2002-Cassaigne #complexity #infinity #word

Constructing Infinite Words of Intermediate Complexity (JC), pp. 173–184.

DLT-2002-SasakiIIW #2d #bound #probability #turing machine

A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines (YS, KI, AI, YW), pp. 185–196.

DLT-2002-Srba #similarity

Undecidability of Weak Bisimilarity for PA-Processes (JS), pp. 197–208.

DLT-2002-Domaratzki #automaton #bound #finite

Improved Bounds on the Number of Automata Accepting Finite Languages (MD), pp. 209–219.

DLT-2002-HorvathLL #regular expression

Roots and Powers of Regular Languages (SH, PL, GL), pp. 220–230.

DLT-2002-GieslM #termination

Innermost Termination of Context-Sensitive Rewriting (JG, AM), pp. 231–244.

DLT-2002-Holub #set #similarity

A Unique Structure of Two-Generated Binary Equality Sets (SH), pp. 245–257.

DLT-2002-HolzerK02a #automaton #finite #monad #on the

On Deterministic Finite Automata and Syntactic Monoid Size (MH, BK), pp. 258–269.

DLT-2002-AnanichevCV #algorithm #automaton #word

An Inverse Automata Algorithm for Recognizing 2-Collapsing Words (DSA, AC, MVV), pp. 270–282.

DLT-2002-Archangelsky #algorithm #equivalence #finite #multi #performance

Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Σ*-Automata (KA), pp. 283–289.

DLT-2002-Imreh #automaton

Some Remarks on Asynchronous Automata (BI), pp. 290–296.

DLT-2002-AltenberndTW #infinity

Tiling Systems over Infinite Pictures and Their Acceptance Conditions (JHA, WT, SW), pp. 297–306.

DLT-2002-BassinoCN #standard #word

The Average Lengths of the Factors of the Standard Factorization of Lyndon Words (FB, JC, CN), pp. 307–318.

DLT-2002-CurrieF #word

Circular Words Avoiding Patterns (JDC, DSF), pp. 319–325.

DLT-2002-IbarraDS #automaton #finite #safety #verification

Safety Verification for Two-Way Finite Automata with Monotonic Counters (OHI, ZD, ZWS), pp. 326–338.

DLT-2002-UmeoK #automaton #communication #infinity #realtime #sequence

An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular Automaton (HU, NK), pp. 339–348.

DLT-2002-Kaszonyi #on the

On the Structure of Graphic DLI-Sets (LK), pp. 349–356.

DLT-2002-Lam #finite

Finite Completion of Comma-Free Codes. Part I (NHL), pp. 357–368.

DLT-2002-DoL #bound #on the #product line

On a Family of Codes with Bounded Deciphering Delay (DLV, IL), pp. 369–380.

DLT-2002-Urvoy #graph #product line

Abstract Families of Graphs (TU), pp. 381–392.

DLT-2002-Okhotin #automaton #linear #representation

Automaton Representation of Linear Conjunctive Languages (AO), pp. 393–404.

DLT-2002-Frougny #online

On-Line Odometers for Two-Sided Symbolic Dynamical Systems (CF), pp. 405–416.

DLT-2002-PetkovicCB #automaton

Characteristic Semigroups of Directable Automata (TP, MC, SB), pp. 417–427.