Tero Harju, Juhani Karhumäki, Arto Lepistö
Proceedings of the 11th International Conference on Developments in Language Theory
DLT, 2007.

@proceedings{DLT-2007,
	address       = "Turku, Finland",
	editor        = "Tero Harju and Juhani Karhumäki and Arto Lepistö",
	isbn          = "978-3-540-73207-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 11th International Conference on Developments in Language Theory}",
	volume        = 4588,
	year          = 2007,
}

Contents (38 items)

12 ×#automaton
8 ×#finite
5 ×#complexity
4 ×#nondeterminism
4 ×#word
3 ×#on the
2 ×#ambiguity
2 ×#equation
2 ×#graph

DLT-2007-DiekertK #first-order #on the #word

On First-Order Fragments for Words and Mazurkiewicz Traces (VD, MK), pp. 1–19.

DLT-2007-Henzinger

Quantitative Generalizations of Languages (TAH), pp. 20–22.

DLT-2007-Kunc #equation #question #what

What Do We Know About Language Equations? (MK), pp. 23–27.

DLT-2007-Li #distance

Information Distance and Applications (ML0), p. 28.

DLT-2007-Sakarovitch #automaton #finite

Finite Automata and the Writing of Numbers (JS), pp. 29–30.

DLT-2007-Salomaa #automaton #complexity #finite #nondeterminism

Descriptional Complexity of Nondeterministic Finite Automata (KS), pp. 31–35.

DLT-2007-AnselmoGM #2d #nondeterminism

From Determinism to Non-determinism in Recognizable Two-Dimensional Languages (MA, DG, MM), pp. 36–47.

DLT-2007-BealBR #ambiguity

Coding Partitions: Regularity, Maximality and Global Ambiguity (MPB, FB, AR), pp. 48–59.

DLT-2007-BelovsRS #automaton #finite #multi #quantum

Multi-letter Reversible and Quantum Finite Automata (AB, AR, JS), pp. 60–71.

DLT-2007-BertoniR #monad

Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids (AB, RR), pp. 72–83.

DLT-2007-BienvenuS #automaton #invariant

The Dynamics of Cellular Automata in Shift-Invariant Topologies (LB, MS), pp. 84–95.

DLT-2007-Blanchet-SadriBP #set #word

Two Element Unavoidable Sets of Partial Words (FBS, NCB, JP), pp. 96–107.

DLT-2007-BordihnHK #automaton #finite

Hairpin Finite Automata (HB, MH, MK), pp. 108–119.

DLT-2007-BrijderH #assembly #graph #reduction

Characterizing Reduction Graphs for Gene Assembly in Ciliates (RB, HJH), pp. 120–131.

DLT-2007-CarotenutoMP #automaton

2-Visibly Pushdown Automata (DC, AM, AP), pp. 132–144.

DLT-2007-ChamparnaudOZ #equation #performance

An Efficient Computation of the Equation K-Automaton of a Regular K-Expression (JMC, FO, DZ), pp. 145–156.

DLT-2007-EsparzaKL

An Extension of Newton’s Method to ω-Continuous Semirings (JE, SK, ML), pp. 157–168.

DLT-2007-Freivalds #automaton #finite #probability

Non-constructive Methods for Finite Probabilistic Automata (RF), pp. 169–180.

DLT-2007-FreydenbergerR #ambiguity #morphism

The Unambiguity of Segmented Morphisms (DDF, DR), pp. 181–192.

DLT-2007-Frid

Commutation of Binary Factorial Languages (AEF), pp. 193–204.

DLT-2007-GruberH #complexity #exclamation #nondeterminism

Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP (HG, MH), pp. 205–216.

DLT-2007-HanS #complexity #finite

State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 217–228.

DLT-2007-HogbergMM #automaton #bisimulation

Bisimulation Minimisation for Weighted Tree Automata (JH, AM, JM), pp. 229–241.

DLT-2007-Jez #boolean grammar

Conjunctive Grammars Can Generate Non-regular Unary Languages (AJ), pp. 242–253.

DLT-2007-JirasekJS #automaton #finite #nondeterminism

Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 254–265.

DLT-2007-JuliaD

Reduced Languages as ω-Generators (SJ, TVD), pp. 266–277.

DLT-2007-KriegerORS #approximate

Avoiding Approximate Squares (DK, PO, NR, JS), pp. 278–289.

DLT-2007-Leupold

Duplication Roots (PL), pp. 290–299.

DLT-2007-LoosO #complexity

Complexity Theory for Splicing Systems (RL, MO), pp. 300–311.

DLT-2007-MalcherP #bound #complexity #context-free grammar

Descriptional Complexity of Bounded Context-Free Languages (AM, GP), pp. 312–323.

DLT-2007-Matthissen #logic

Definable Transductions and Weighted Logics for Texts (CM), pp. 324–336.

DLT-2007-OchmanskiS

A Star Operation for Star-Free Trace Languages (EO, KS), pp. 337–345.

DLT-2007-Priese #automaton #finite #graph

Finite Automata on Unranked and Unordered DAGs (LP), pp. 346–360.

DLT-2007-Pritykin #on the #sequence

On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases (YP), pp. 361–370.

DLT-2007-Richomme #word

A Local Balance Property of Episturmian Words (GR), pp. 371–381.

DLT-2007-SciortinoZ #automaton #standard #word

Suffix Automata and Standard Sturmian Words (MS, LQZ), pp. 382–398.

DLT-2007-Selivanov

Fine Hierarchy of Regular Aperiodic ω-Languages (VLS), pp. 399–410.

DLT-2007-Tamm #automaton #on the

On Transition Minimality of Bideterministic Automata (HT), pp. 411–421.