Cristian Calude, Elena Calude, Michael J. Dinneen
Proceedings of the Eighth International Conference on Developments in Language Theory
DLT, 2004.

@proceedings{DLT-2004,
	address       = "Auckland, New Zealand",
	editor        = "Cristian Calude and Elena Calude and Michael J. Dinneen",
	isbn          = "3-540-24014-4",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Eighth International Conference on Developments in Language Theory}",
	volume        = 3340,
	year          = 2004,
}

Contents (35 items)

8 ×#automaton
8 ×#on the
4 ×#problem
3 ×#complexity
3 ×#set
2 ×#2d
2 ×#algorithm
2 ×#array
2 ×#communication
2 ×#context-free grammar

DLT-2004-Courcelle #graph #overview #relational #set

Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey (BC), pp. 1–11.

DLT-2004-DowneyM #complexity

Some New Directions and Questions in Parameterized Complexity (RGD, CM), pp. 12–26.

DLT-2004-EhrenfeuchtR

Basic Notions of Reaction Systems (AE, GR), pp. 27–29.

DLT-2004-GenestMK #algorithm #automaton #communication #effectiveness #theorem

A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms (BG, AM, DK), pp. 30–48.

DLT-2004-JonoskaS #algebra #modelling #process

Algebraic and Topological Models for DNA Recombinant Processes (NJ, MS), pp. 49–62.

DLT-2004-AnselmoGM #2d #regular expression

Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet (MA, DG, MM), pp. 63–75.

DLT-2004-BeekCHV #on the

On Competence in CD Grammar Systems (MHtB, ECV, MH, GV), pp. 76–88.

DLT-2004-BorchertLSTT #polynomial

The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels (BB, KJL, FS, PT, DT), pp. 89–101.

DLT-2004-BordihnHK #automaton #geometry

Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages (HB, MH, MK), pp. 102–113.

DLT-2004-ChoffrutGL #on the

On the Maximum Coefficients of Rational Formal Series in Commuting Variables (CC, MG, VL), pp. 114–126.

DLT-2004-DaleyD #on the

On Codes Defined by Bio-Operations (MD, MD), pp. 127–138.

DLT-2004-DAlessandroV #set

Avoidable Sets and Well Quasi-Orders (FD, SV), pp. 139–150.

DLT-2004-Dassow #product line

A Ciliate Bio-operation and Language Families (JD), pp. 151–162.

DLT-2004-Domaratzki #semantics

Semantic Shuffle on and Deletion Along Trajectories (MD), pp. 163–174.

DLT-2004-EpifanioMSV #graph

Sturmian Graphs and a Conjecture of Moser (CE, FM, JS, IV), pp. 175–187.

DLT-2004-Freund #array #string

P Systems Working in the Sequential Mode on Arrays and Strings (RF), pp. 188–199.

DLT-2004-GruskaTP #array #communication #problem

Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings (JG, SLT, MP), pp. 200–211.

DLT-2004-IbarraYD #parallel #power of

The Power of Maximal Parallelism in P Systems (OHI, HCY, ZD), pp. 212–224.

DLT-2004-InenagaST #algorithm #context-free grammar #pattern matching #performance #subclass

An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars (SI, AS, MT), pp. 225–236.

DLT-2004-JurdzinskiOMP #automaton #complexity #on the

On the Complexity of 2-Monotone Restarting Automata (TJ, FO, FM, MP), pp. 237–248.

DLT-2004-JurdzinskiOMP04a #automaton #on the

On Left-Monotone Deterministic Restarting Automata (TJ, FO, FM, MP), pp. 249–260.

DLT-2004-KurganskyyP #2d #automaton #finite #on the #power of

On the Computation Power of Finite Automata in Two-dimensional Environments (OK, IP), pp. 261–271.

DLT-2004-KuskeW #automaton

The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems (DK, PW), pp. 272–283.

DLT-2004-KutribMW #context-free grammar #linear

The Boolean Closure of Linear Context-Free Languages (MK, AM, DW), pp. 284–295.

DLT-2004-LakinT #problem

Context-Sensitive Decision Problems in Groups (SRL, RMT), pp. 296–307.

DLT-2004-Lohrey #automation #complexity #decidability #monad

Decidability and Complexity in Automatic Monoids (ML), pp. 308–320.

DLT-2004-Maletti #automaton #transducer

Relating Tree Series Transducers and Weighted Tree Automata (AM), pp. 321–333.

DLT-2004-MuschollW #ltl

An NP-Complete Fragment of LTL (AM, IW), pp. 334–344.

DLT-2004-Potapov #automaton #matrix #multi #problem #reachability

From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata (IP), pp. 345–356.

DLT-2004-Rampersad #morphism #word

Words Avoiding 7/3-Powers and the Thue-Morse Morphism (NR), pp. 357–367.

DLT-2004-Reidenbach #equivalence #on the #pattern matching #problem

On the Equivalence Problem for E-pattern Languages over Small Alphabets (DR), pp. 368–380.

DLT-2004-RispalC #linear #order #set

Complementation of Rational Sets on Countable Scattered Linear Orderings (CR, OC), pp. 381–392.

DLT-2004-Staiger #on the

On the Hausdorff Measure of ω-Power Languages (LS), pp. 393–405.

DLT-2004-Truthe

A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages (BT), pp. 406–417.

DLT-2004-Verlan

Tissue P Systems with Minimal Symport/Antiport (SV), pp. 418–430.