Zoltán Ésik, Zoltán Fülöp
Proceedings of the Seventh International Conference on Developments in Language Theory
DLT, 2003.

@proceedings{DLT-2003,
	address       = "Szeged, Hungary",
	editor        = "Zoltán Ésik and Zoltán Fülöp",
	isbn          = "3-540-40434-1",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Seventh International Conference on Developments in Language Theory}",
	volume        = 2710,
	year          = 2003,
}

Contents (34 items)

14 ×#automaton
5 ×#on the
4 ×#finite
2 ×#nondeterminism
2 ×#set

DLT-2003-BertoniMP #automaton #quantum

Quantum Computing: 1-Way Quantum Automata (AB, CM, BP), pp. 1–20.

DLT-2003-Esparza #approach #verification

An Automata-Theoretic Approach to Software Verification (JE), p. 21.

DLT-2003-Gecseg #automaton #set

Comments on Complete Sets of Tree Automata (FG), pp. 22–34.

DLT-2003-GomezP #on the

On a Conjecture of Schnoebelen (ACG, JÉP), pp. 35–54.

DLT-2003-Otto #automaton

Restarting Automata and Their Relations to the Chomsky Hierarchy (FO), pp. 55–74.

DLT-2003-Plandowski #product line #scalability #testing

Test Sets for Large Families of Languages (WP), pp. 75–94.

DLT-2003-Vollmer #complexity

Complexity Theory Made Easy (HV), pp. 95–110.

DLT-2003-AnanichevV #automaton

Synchronizing Monotonic Automata (DSA, MVV), pp. 111–121.

DLT-2003-AnselmoM #formal method #perspective #problem

Covering Problems from a Formal Language Point of View (MA, MM), pp. 122–133.

DLT-2003-BonizzoniFMZ #finite #reflexive #regular expression

Regular Languages Generated by Reflexive Finite Splicing Systems (PB, CdF, GM, RZ), pp. 134–145.

DLT-2003-Borchardt #theorem

The Myhill-Nerode Theorem for Recognizable Tree Series (BB), pp. 146–158.

DLT-2003-BouillardM #generative

Generating Series of the Trace Group (AB, JM), pp. 159–170.

DLT-2003-CarmeGLTT #automaton #finite

Residual Finite Tree Automata (JC, RG, AL, AT, MT), pp. 171–182.

DLT-2003-CaronF

From Glushkov WFAs to Rational Expressions (PC, MF), pp. 183–193.

DLT-2003-ChamparnaudC #algorithm #automaton #nondeterminism #reduction

NFA Reduction Algorithms by Means of Regular Inequalities (JMC, FC), pp. 194–205.

DLT-2003-ReghizziP

Tile Rewriting Grammars (SCR, MP), pp. 206–217.

DLT-2003-Csuhaj-VarjuMV #automaton #distributed

Distributed Pushdown Automata Systems: Computational Power (ECV, VM, GV), pp. 218–229.

DLT-2003-DAlessandroV #on the

On Well Quasi-orders on Languages (FD, SV), pp. 230–241.

DLT-2003-FalcoGL #modelling #probability

Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models (DdF, MG, VL), pp. 242–253.

DLT-2003-Domaratzki #automaton #on the

On Enumeration of Müller Automata (MD), pp. 254–265.

DLT-2003-DrewesE #branch

Branching Grammars: A Generalization of ET0L Systems (FD, JE), pp. 266–278.

DLT-2003-DrewesH #education #learning

Learning a Regular Tree Language from a Teacher (FD, JH), pp. 279–291.

DLT-2003-FreundMOP #on the

On Three Classes of Automata-Like P Systems (RF, CMV, AO, GP), pp. 292–303.

DLT-2003-Giammarresi #bound #set

Computing Languages by (Bounded) Local Sets (DG), pp. 304–315.

DLT-2003-HarjuN

About Duval’s Conjecture (TH, DN), pp. 316–324.

DLT-2003-HemaspaandraMT

Computation with Absolutely No Space Overhead (LAH, PM, TT), pp. 325–336.

DLT-2003-HofbauerW #string #term rewriting

Deleting String Rewriting Systems Preserve Regularity (DH, JW), pp. 337–348.

DLT-2003-HolzerK #automaton #finite #monad #on the

On Deterministic Finite Automata and Syntactic Monoid Size, Continued (MH, BK), pp. 349–360.

DLT-2003-HolzerK03a #automaton #nondeterminism

Flip-Pushdown Automata: Nondeterminism Is Better than Determinism (MH, MK), pp. 361–372.

DLT-2003-KlimannLMP #ambiguity #automaton

Deciding the Sequentiality of a Finitely Ambiguous Max-Plus Automaton (IK, SL, JM, CP), pp. 373–385.

DLT-2003-Malcher #automaton #finite

Minimizing Finite Automata Is Computationally Hard (AM), pp. 386–397.

DLT-2003-Okhotin #boolean grammar

Boolean Grammars (AO), pp. 398–410.

DLT-2003-Polak #automaton

Syntactic Semiring and Universal Automaton (LP), pp. 411–422.

DLT-2003-Rahonis #automaton #transducer

Alphabetic Pushdown Tree Transducers (GR), pp. 423–436.