Carlos Martín-Vide, Friedrich Otto, Henning Fernau
Revised Papers of the Second International Conference on Language and Automata Theory and Applications
LATA, 2008.

@proceedings{LATA-2008,
	address       = "Tarragona, Spain",
	editor        = "Carlos Martín-Vide and Friedrich Otto and Henning Fernau",
	isbn          = "978-3-540-88281-7",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Revised Papers of the Second International Conference on Language and Automata Theory and Applications}",
	volume        = 5196,
	year          = 2008,
}

Contents (44 items)

13 ×#automaton
7 ×#on the
5 ×#finite
4 ×#bound
4 ×#word
3 ×#2d
2 ×#algorithm
2 ×#hybrid
2 ×#morphism
2 ×#performance

LATA-2008-Bojanczyk #automaton

Tree-Walking Automata (MB), pp. 1–2.

LATA-2008-Domaratzki #formal method #tool support

Formal Language Tools for Template-Guided DNA Recombination (MD), pp. 3–5.

LATA-2008-Steinberg #matrix #sequence #theorem

Subsequence Counting, Matrix Representations and a Theorem of Eilenberg (BS), pp. 6–10.

LATA-2008-Volkov #automaton

Synchronizing Automata and the Cerny Conjecture (MVV), pp. 11–27.

LATA-2008-AlhazovCMR #hybrid #network

About Universal Hybrid Networks of Evolutionary Processors of Small Size (AA, ECV, CMV, YR), pp. 28–39.

LATA-2008-Altenbernd #on the

On Bifix Systems and Generalizations (JHA), pp. 40–51.

LATA-2008-AndersonRSS #automaton #finite

Finite Automata, Palindromes, Powers, and Patterns (TA, NR, NS, JS), pp. 52–63.

LATA-2008-ArrighiNW #automaton #bound #finite #quantum

One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations (PA, VN, RFW), pp. 64–75.

LATA-2008-BaumeisterR #problem #reduction

The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions (DB, JR), pp. 76–87.

LATA-2008-BechetDFG

Optional and Iterated Types for Pregroup Grammars (DB, AJD, AF, EG), pp. 88–100.

LATA-2008-Becker #self

Transformations and Preservation of Self-assembly Dynamics through Homotheties (FB), pp. 101–112.

LATA-2008-BenschBHK #automaton #finite

Deterministic Input-Reversal and Input-Revolving Finite Automata (SB, HB, MH, MK), pp. 113–124.

LATA-2008-BordihnH #distributed #random

Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems (HB, MH), pp. 125–136.

LATA-2008-BrijderH #assembly #graph

Extending the Overlap Graph for Gene Assembly in Ciliates (RB, HJH), pp. 137–148.

LATA-2008-CainORT #automation

Automatic Presentations for Cancellative Semigroups (AJC, GPO, NR, RMT), pp. 149–159.

LATA-2008-Capobianco #automaton

Induced Subshifts and Cellular Automata (SC), pp. 160–171.

LATA-2008-CastiglioneRS #algorithm #automaton

Hopcroft’s Algorithm and Cyclic Automata (GC, AR, MS), pp. 172–183.

LATA-2008-ChampavereGLN #automaton #performance

Efficient Inclusion Checking for Deterministic Tree Automata and DTDs (JC, RG, AL, JN), pp. 184–195.

LATA-2008-Crespi-ReghizziP #set

Consensual Definition of Languages by Regular Sets (SCR, PSP), pp. 196–208.

LATA-2008-DassowT #petri net

k-Petri Net Controlled Grammars (JD, ST), pp. 209–220.

LATA-2008-GawrychowskiK #word

2-Synchronizing Words (PG, AK), pp. 221–231.

LATA-2008-Giraud #string

Not So Many Runs in Strings (MG), pp. 232–239.

LATA-2008-PhuongHRV #approach #hybrid #segmentation #word

A Hybrid Approach to Word Segmentation of Vietnamese Texts (HPL, NTMH, AR, HTV), pp. 240–249.

LATA-2008-Kahramanogullari #concurrent #linear #logic #on the

On Linear Logic Planning and Concurrency (OK), pp. 250–262.

LATA-2008-KallmeyerP #component #multi #on the #tuple

On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) (LK, YP), pp. 263–274.

LATA-2008-KirchnerKM #pattern matching

Anti-pattern Matching Modulo (CK, RK, PEM), pp. 275–286.

LATA-2008-KitaevMS #morphism #order #word

Counting Ordered Patterns in Words Generated by Morphisms (SK, TM, PS), pp. 287–298.

LATA-2008-KlimaP #morphism

Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups (OK, LP), pp. 299–310.

LATA-2008-Klunder #automaton #finite #using

Characterization of Star-Connected Languages Using Finite Automata (BK), pp. 311–320.

LATA-2008-KorpM #bound #dependence #proving #term rewriting #termination

Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (MK, AM), pp. 321–332.

LATA-2008-KrassovitskiyRV

Further Results on Insertion-Deletion Systems with One-Sided Contexts (AK, YR, SV), pp. 333–344.

LATA-2008-Leupold #on the #string #term rewriting

On Regularity-Preservation by String-Rewriting Systems (PL), pp. 345–356.

LATA-2008-Maletti #automaton

Minimizing Deterministic Weighted Tree Automata (AM), pp. 357–372.

LATA-2008-Mercer #automaton #bound #finite #quantum

Lower Bounds for Generalized Quantum Finite Automata (MM), pp. 373–384.

LATA-2008-MoczuradM #how #question #set

How Many Figure Sets Are Codes? (MM, WM), pp. 385–396.

LATA-2008-MoriyaO #on the

On Alternating Phrase-Structure Grammars (EM, FO), pp. 397–408.

LATA-2008-OttoP #2d #taxonomy

A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata (FO, MP), pp. 409–420.

LATA-2008-Perekrestenko #bound #np-hard

Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard (AP), pp. 421–432.

LATA-2008-Petersen #sorting #turing machine

Sorting and Element Distinctness on One-Way Turing Machines (HP), pp. 433–439.

LATA-2008-Puzynina #2d #on the #word

On Periodicity of Generalized Two-Dimensional Words (SP), pp. 440–451.

LATA-2008-RegnaultST #2d #analysis #automaton #on the #probability

On the Analysis of “Simple” 2D Stochastic Cellular Automata (DR, NS, ET), pp. 452–463.

LATA-2008-RenderK #automaton

Polycyclic and Bicyclic Valence Automata (ER, MK), pp. 464–475.

LATA-2008-SalomaaSY

Length Codes, Products of Languages and Primality (AS, KS, SY), pp. 476–486.

LATA-2008-Yoshinaka #algorithm #performance #problem #subclass

An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs (RY), pp. 487–498.