Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu
Proceedings of the 14th International Conference on Developments in Language Theory
DLT, 2010.

@proceedings{DLT-2010,
	address       = "London, Ontario, Canada",
	doi           = "10.1007/978-3-642-14455-4",
	editor        = "Yuan Gao and Hanlin Lu and Shinnosuke Seki and Sheng Yu",
	isbn          = "978-3-642-14454-7",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 14th International Conference on Developments in Language Theory}",
	volume        = 6224,
	year          = 2010,
}

Contents (44 items)

14 ×#on the
7 ×#automaton
5 ×#problem
5 ×#word
3 ×#complexity
3 ×#parallel
2 ×#algebra
2 ×#algorithm
2 ×#bound
2 ×#context-free grammar

DLT-2010-EhrenfeuchtR

Reaction Systems: A Model of Computation Inspired by Biochemistry (AE, GR), pp. 1–3.

DLT-2010-Giammarresi #2d

A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages (DG), pp. 4–15.

DLT-2010-HolzerK #complexity

The Complexity of Regular(-Like) Expressions (MH, MK), pp. 16–30.

DLT-2010-Ibarra #on the #problem

On Decision Problems for Simple and Parameterized Machines (OHI), p. 31.

DLT-2010-Kari

DNA Computing and Its Implications for Theoretical Computer Science (LK), p. 32.

DLT-2010-Rigo #formal method

Numeration Systems: A Link between Number Theory and Formal Language Theory (MR), pp. 33–53.

DLT-2010-BenschBD #algorithm

Algorithmic Properties of Millstream Systems (SB, HB, FD), pp. 54–65.

DLT-2010-Berlinkov #on the

On a Conjecture by Carpi and D’Alessandro (MVB), pp. 66–75.

DLT-2010-BerrimaR #algebra #bisimulation #equivalence

Linking Algebraic Observational Equivalence and Bisimulation (MB, NBR), pp. 76–87.

DLT-2010-BordihnKM #automaton #communication #finite #parallel

Undecidability and Hierarchy Results for Parallel Communicating Finite Automata (HB, MK, AM), pp. 88–99.

DLT-2010-BremerF #bound #problem

Inclusion Problems for Patterns with a Bounded Number of Variables (JB, DDF), pp. 100–111.

DLT-2010-BrodaMMR #automaton #on the

On the Average Number of States of Partial Derivative Automata (SB, AM, NM, RR), pp. 112–123.

DLT-2010-CarpiD #hybrid #on the #problem

On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths (AC, FD), pp. 124–135.

DLT-2010-ChambartS #problem #set

Computing Blocker Sets for the Regular Post Embedding Problem (PC, PS), pp. 136–147.

DLT-2010-DartoisKL #infinity #word

Rankers over Infinite Words (LD, MK, AL), pp. 148–159.

DLT-2010-DrosteV #automaton #bound #logic #multi #theorem

Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices (MD, HV), pp. 160–172.

DLT-2010-EsikI #context-free grammar #on the

On Müller Context-Free Grammars (ZÉ, SI), pp. 173–184.

DLT-2010-FrieseSM #bottom-up #transducer

Minimization of Deterministic Bottom-Up Tree Transducers (SF, HS, SM), pp. 185–196.

DLT-2010-GeffertP #automaton

Two-Way Unary Automata versus Logarithmic Space (VG, GP), pp. 197–208.

DLT-2010-HalavaHKR #on the #word

On the Periodicity of Morphic Words (VH, TH, TK, MR), pp. 209–217.

DLT-2010-HauboldLM #graph #morphism #problem #word

Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups (NH, ML, CM), pp. 218–230.

DLT-2010-Head #algebra #parallel #using

Using Light to Implement Parallel Boolean Algebra (TH), pp. 231–242.

DLT-2010-JeandelV

Periodicity in Tilings (EJ, PV), pp. 243–254.

DLT-2010-JiraskovaM #complexity #regular expression

Complexity in Union-Free Regular Languages (GJ, TM), pp. 255–266.

DLT-2010-KariS #parallel

Schema for Parallel Insertion and Deletion (LK, SS), pp. 267–278.

DLT-2010-KlimaP #on the

On Schützenberger Products of Semirings (OK, LP), pp. 279–290.

DLT-2010-LehtinenO #equation #on the

On Language Equations XXK = XXL and XM = N over a Unary Alphabet (TL, AO), pp. 291–302.

DLT-2010-LodayaPS

Around Dot Depth Two (KL, PKP, SSS), pp. 303–315.

DLT-2010-Maletti #top-down #transducer

Input Products for Weighted Extended Top-Down Tree Transducers (AM), pp. 316–327.

DLT-2010-MarinK #revisited

Regular Hedge Language Factorization Revisited (MM, TK), pp. 328–339.

DLT-2010-Okhotin #algorithm #boolean grammar #parsing #performance

Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm (AO), pp. 340–351.

DLT-2010-OttoPM #automaton #on the

On Lexicalized Well-Behaved Restarting Automata That Are Monotone (FO, MP, FM), pp. 352–363.

DLT-2010-PorrecaLZ #on the

On a Powerful Class of Non-universal P Systems with Active Membranes (AEP, AL, CZ), pp. 364–375.

DLT-2010-PribavkinaR #complexity #regular expression

State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages (EVP, ER), pp. 376–386.

DLT-2010-ReidenbachS #ambiguity #morphism #strict

Restricted Ambiguity of Erasing Morphisms (DR, JCS), pp. 387–398.

DLT-2010-RestivoV #automaton

Automata with Extremal Minimality Conditions (AR, RV), pp. 399–410.

DLT-2010-Shur #on the

On the Existence of Minimal β-Powers (AMS), pp. 411–422.

DLT-2010-Steinberg

The Averaging Trick and the Cerný Conjecture (BS), pp. 423–431.

DLT-2010-ChiniforooshanKX #pseudo

Pseudo-power Avoidance (EC, LK, ZX), pp. 432–433.

DLT-2010-DassowM #context-free grammar #on the #strict

On Restricted Context-Free Grammars (JD, TM), pp. 434–435.

DLT-2010-HalldorssonKP #graph #word

Graphs Capturing Alternations in Words (MMH, SK, AVP), pp. 436–437.

DLT-2010-Kopecki #on the

On the Iterated Hairpin Completion (SK), pp. 438–439.

DLT-2010-Schluter #automaton #lookahead #on the

On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (NS), pp. 440–441.

DLT-2010-Staiger #finite #infinity #word

Joint Topologies for Finite and Infinite Words (LS), pp. 442–443.