Werner Kuich, Grzegorz Rozenberg, Arto Salomaa
Revised Papers of the Fifth International Conference on Developments in Language Theory
DLT, 2001.

@proceedings{DLT-2001,
	address       = "Vienna, Austria",
	editor        = "Werner Kuich and Grzegorz Rozenberg and Arto Salomaa",
	isbn          = "3-540-43453-4",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Papers of the Fifth International Conference on Developments in Language Theory}",
	volume        = 2295,
	year          = 2001,
}

Contents (34 items)

6 ×#automaton
3 ×#string
3 ×#word
2 ×#communication
2 ×#complexity
2 ×#on the
2 ×#parallel
2 ×#power of

DLT-2001-CaludeC #automaton #named #nondeterminism #quantum

Automata: From Uncertainty to Quantum (CC, EC), pp. 1–14.

DLT-2001-Choffrut

Elementary Theory of Ordinals with Addition and Left Translation by ω (CC), pp. 15–20.

DLT-2001-Esik #equation #fixpoint

The Equational Theory of Fixed Points with Applications to Generalized Language Theory (ZÉ), pp. 21–36.

DLT-2001-EiterGS #higher-order #logic #string

Second-Order Logic over Strings: Regular and Non-regular Fragments (TE, GG, TS), pp. 37–56.

DLT-2001-Harju #integer #matrix

Decision Questions on Integer Matrices (TH), pp. 57–68.

DLT-2001-ItoK #petri net

Some Petri Net Languages and Codes (MI, YK), pp. 69–80.

DLT-2001-Prodinger #permutation #word

Words, Permutations, and Representations of Numbers (HP), pp. 81–99.

DLT-2001-Razborov #complexity #proving

Proof Complexity of Pigeonhole Principles (AAR), pp. 100–116.

DLT-2001-RestivoS #word

Words and Patterns (AR, SS), pp. 117–129.

DLT-2001-Thomas #automaton #infinity

A Short Introduction to Infinite Automata (WT), pp. 130–144.

DLT-2001-Cachat #power of

The Power of One-Letter Rational Languages (TC), pp. 145–154.

DLT-2001-Staiger

The Entropy of Lukasiewicz-Languages (LS), pp. 155–165.

DLT-2001-AnanichevV #word

Collapsing Words vs. Synchronizing Words (DSA, MVV), pp. 166–174.

DLT-2001-CulikKK #automaton #problem

A Note on Synchronized Automata and Road Coloring Problem (KCI, JK, JK), pp. 175–185.

DLT-2001-CampeanuSV

Shuffle Quotient and Decompositions (CC, KS, SV), pp. 186–196.

DLT-2001-NiemannW #context-sensitive grammar

The Growing Context-Sensitive Languages Are the Acyclic Context-Sensitive Languages (GN, JRW), pp. 197–205.

DLT-2001-Kuske #axiom #set

Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable (DK), pp. 206–216.

DLT-2001-EsikN #automaton

Automata on Series-Parallel Biposets (ZÉ, ZLN), pp. 217–227.

DLT-2001-EngelfrietM #string #transducer

Hierarchies of String Languages Generated by Deterministic Tree Transducers (JE, SM), pp. 228–238.

DLT-2001-SchwentickTV #automaton

Partially-Ordered Two-Way Automata: A New Characterization of DA (TS, DT, HV), pp. 239–250.

DLT-2001-GlasserS

Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets (CG, HS), pp. 251–261.

DLT-2001-HromkovicS #automaton #on the #power of #random

On the Power of Randomized Pushdown Automata (JH, GS), pp. 262–271.

DLT-2001-Lischke #complexity

The Root of a Language and Its Complexity (GL), pp. 272–280.

DLT-2001-FernauS #algebra #perspective

Valuated and Valence Grammars: An Algebraic View (HF, RS), pp. 281–292.

DLT-2001-Hoogeboom #revisited

Context-Free Valence Grammars — Revisited (HJH), pp. 293–303.

DLT-2001-HalavaH #morphism

An Undecidability Result Concerning Periodic Morphisms (VH, TH), pp. 304–310.

DLT-2001-KudlekR #turing machine

A Universal Turing Machine with 3 States and 9 Symbols (MK, YR), pp. 311–318.

DLT-2001-DomaratzkiSY #formal method

Minimal Covers of Formal Languages (MD, JS, SY), pp. 319–329.

DLT-2001-NiemannW01a #regular expression

Some Regular Languages That Are Church-Rosser Congruential (GN, JW), pp. 330–339.

DLT-2001-BeaudryHNO #on the #product line

On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy (MB, MH, GN, FO), pp. 340–348.

DLT-2001-MignosiRS #assembly

Forbidden Factors and Fragment Assembly (FM, AR, MS), pp. 349–358.

DLT-2001-Csuhaj-VarjuV #communication #parallel

Parallel Communicating Grammar Systems with Incomplete Information Communication (ECV, GV), pp. 359–368.

DLT-2001-RovanS #communication #parallel

Eliminating Communication by Parallel Rewriting (BR, MS), pp. 369–278.

DLT-2001-SosikF #string

String Rewriting Sequential P-Systems and Regulated Rewriting (PS, RF), pp. 379–388.