Adrian Horia Dediu, Henning Fernau, Carlos Martín-Vide
Proceedings of the Fourth International Conference on Language and Automata Theory and Applications
LATA, 2010.

@proceedings{LATA-2010,
	address       = "Trier, Germany",
	doi           = "10.1007/978-3-642-13089-2",
	editor        = "Adrian Horia Dediu and Henning Fernau and Carlos Martín-Vide",
	isbn          = "978-3-642-13088-5",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fourth International Conference on Language and Automata Theory and Applications}",
	volume        = 6031,
	year          = 2010,
}

Contents (51 items)

12 ×#automaton
8 ×#problem
5 ×#word
4 ×#complexity
4 ×#context-free grammar
4 ×#regular expression
3 ×#analysis
3 ×#multi
3 ×#on the
3 ×#string

LATA-2010-Brzozowski #complexity

Complexity in Convex Languages (JAB), pp. 1–15.

LATA-2010-Clark #modelling

Three Learnable Models for the Description of Language (AC), pp. 16–31.

LATA-2010-Melichar #automaton #named

Arbology: Trees and Pushdown Automata (BM), pp. 32–49.

LATA-2010-Muscholl #analysis #automaton #communication

Analysis of Communicating Automata (AM), pp. 50–57.

LATA-2010-AravantinosCP #complexity #problem #satisfiability

Complexity of the Satisfiability Problem for a Class of Propositional Schemata (VA, RC, NP), pp. 58–69.

LATA-2010-ArrighiG #automaton #quantum

A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton (PA, JG), pp. 70–81.

LATA-2010-Arslan #algorithm #performance #sequence #string

A Fast Longest Common Subsequence Algorithm for Similar Strings (ANA), pp. 82–93.

LATA-2010-Blanchet-SadriKMSS #word

Abelian Square-Free Partial Words (FBS, JIK, RM, WS, SS), pp. 94–105.

LATA-2010-Blanchet-SadriMSW #word

Avoidable Binary Patterns in Partial Words (FBS, RM, SS, EW), pp. 106–117.

LATA-2010-BousquetL #ambiguity #automaton #equivalence #problem

Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata (NB, CL), pp. 118–129.

LATA-2010-BuszkowskiL

Pregroup Grammars with Letter Promotions (WB, ZL), pp. 130–141.

LATA-2010-CabessaV #classification #first-order #network

A Hierarchical Classification of First-Order Recurrent Neural Networks (JC, AEPV), pp. 142–153.

LATA-2010-CarrascosaCGL #problem #word

Choosing Word Occurrences for the Smallest Grammar Problem (RC, FC, MG, GGIL), pp. 154–165.

LATA-2010-Casadio #analysis

Agreement and Cliticization in Italian: A Pregroup Analysis (CC), pp. 166–177.

LATA-2010-ChamparnaudDJ #geometry #regular expression

Geometricity of Binary Regular Languages (JMC, JPD, HJ), pp. 178–189.

LATA-2010-ChoffrutMMP #on the #power of

On the Expressive Power of FO[+] (CC, AM, CM, BP), pp. 190–201.

LATA-2010-FlorencioF #approach #bound #consistency

Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach (CCF, HF), pp. 202–213.

LATA-2010-Crespi-ReghizziM #automaton #precedence

Operator Precedence and the Visibly Pushdown Property (SCR, DM), pp. 214–226.

LATA-2010-CrochemoreIKRRW #on the #polynomial #string

On the Maximal Number of Cubic Runs in a String (MC, CSI, MK, JR, WR, TW), pp. 227–238.

LATA-2010-Cruz-SantosM #on the #quantum #reduction #satisfiability

On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT (WCS, GML), pp. 239–248.

LATA-2010-GiampaoloTN #logic #metric #parametricity

Parametric Metric Interval Temporal Logic (BDG, SLT, MN), pp. 249–260.

LATA-2010-Ehlers #automaton

Short Witnesses and Accepting Lassos in ω-Automata (RE), pp. 261–272.

LATA-2010-GagieG #grammarware #streaming

Grammar-Based Compression in a Streaming Model (TG, PG), pp. 273–284.

LATA-2010-GruberG #regular expression

Simplifying Regular Expressions (HG, SG), pp. 285–296.

LATA-2010-HemmerlingSK #difference #equation #network #process #programming language #specification

A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks (RH, KS, WK), pp. 297–308.

LATA-2010-Hovland #problem #regular expression

The Inclusion Problem for Regular Expressions (DH), pp. 309–320.

LATA-2010-JainLS #automation

Learnability of Automatic Classes (SJ, QL, FS), pp. 321–332.

LATA-2010-JordanZ #first-order #quantifier

Untestable Properties Expressible with Four First-Order Quantifiers (CJ, TZ), pp. 333–343.

LATA-2010-KanazawaS #context-free grammar #multi #power of

The Copying Power of Well-Nested Multiple Context-Free Grammars (MK, SS), pp. 344–355.

LATA-2010-KlunderR #commutative #problem

Post Correspondence Problem with Partially Commutative Alphabets (BK, WR), pp. 356–367.

LATA-2010-KutribM #automaton

Reversible Pushdown Automata (MK, AM), pp. 368–379.

LATA-2010-KasprzikK #learning #string #using

String Extension Learning Using Lattices (AK, TK), pp. 380–391.

LATA-2010-LetichevskySS #automaton #equivalence #finite #multi #problem #proving #using

The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape (AAL, ASS, SKS), pp. 392–402.

LATA-2010-Leupold #context-free grammar #word

Primitive Words Are Unavoidable for Context-Free Languages (PL), pp. 403–413.

LATA-2010-Lin #calculus #complexity

Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness (ZL0), pp. 414–425.

LATA-2010-ManeaT #problem #word

Hard Counting Problems for Partial Words (FM, CT), pp. 426–438.

LATA-2010-MarschallR #algorithm #analysis #automaton #pattern matching #probability

Exact Analysis of Horspool’s and Sunday’s Pattern Matching Algorithms with Probabilistic Arithmetic Automata (TM, SR), pp. 439–450.

LATA-2010-MiloPZ #constraints #named #regular expression #sequence

SA-REPC — Sequence Alignment with Regular Expression Path Constraint (NM, TP, MZU), pp. 451–462.

LATA-2010-NagyO

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages (BN, FO), pp. 463–474.

LATA-2010-Neary #bound

A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems (TN), pp. 475–487.

LATA-2010-Penaloza #reasoning #standard #using

Using Sums-of-Products for Non-standard Reasoning (RP), pp. 488–499.

LATA-2010-PlatekML #automaton #functional #generative

Restarting Automata with Structured Output and Functional Generative Description (MP, FM, ML), pp. 500–511.

LATA-2010-PolicritiTV #random

A Randomized Numerical Aligner (rNA) (AP, AIT, FV), pp. 512–523.

LATA-2010-VelardoD #comparison #order #petri net

Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data (FRV, GD), pp. 524–535.

LATA-2010-SaeedloeiG #induction #realtime #verification

Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R) (NS, GG), pp. 536–548.

LATA-2010-BalanS #incremental #problem

Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem (MSB, PS), pp. 549–560.

LATA-2010-GrumbergKS #automaton #infinity

Variable Automata over Infinite Alphabets (OG, OK, SS), pp. 561–572.

LATA-2010-Tamm #automaton

Some Minimality Results on Biresidual and Biseparable Automata (HT), pp. 573–584.

LATA-2010-WeinbergN #context-free grammar #probability

Extending Stochastic Context-Free Grammars for an Application in Bioinformatics (FW, MEN), pp. 585–595.

LATA-2010-YoshinakaKS #context-free grammar #multi

Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages (RY, YK, HS), pp. 596–607.

LATA-2010-Zantema #complexity

Complexity of Guided Insertion-Deletion in RNA-Editing (HZ), pp. 608–619.