Proceedings of the Fifth International Conference on Language and Automata Theory and Applications
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Adrian Horia Dediu, Shunsuke Inenaga, Carlos Martín-Vide
Proceedings of the Fifth International Conference on Language and Automata Theory and Applications
LATA, 2011.

Full names Links ISxN
	address       = "Tarragona, Spain",
	doi           = "10.1007/978-3-642-21254-3",
	editor        = "Adrian Horia Dediu and Shunsuke Inenaga and Carlos Martín-Vide",
	isbn          = "978-3-642-21253-6",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fifth International Conference on Language and Automata Theory and Applications}",
	volume        = 6638,
	year          = 2011,

Contents (40 items)

LATA-2011-Colcombet #automaton
Green’s Relations and Their Use in Automata Theory (TC), pp. 1–21.
LATA-2011-Khoussainov #automation
Automatic Structures and Groups (BK), pp. 22–40.
LATA-2011-Leroux #problem #proving #reachability #self
Vector Addition System Reachability Problem: A Short Self-contained Proof (JL), pp. 41–64.
Abstract Numeration Systems (NR), pp. 65–79.
Rule Formats for Distributivity (LA, MC, AI, MRM, MAR), pp. 80–91.
Mutation Systems (DA, JA, RBV), pp. 92–104.
LATA-2011-AnselmoGM #classification #string
Classification of String Languages via Tiling Recognizable Picture Languages (MA, DG, MM), pp. 105–116.
LATA-2011-AxelsenG #performance #turing machine
A Simple and Efficient Universal Reversible Turing Machine (HBA, RG), pp. 117–128.
LATA-2011-BareckaC #automaton #complexity #finite #problem
The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (AB, WC), pp. 129–141.
Recognizing Shuffled Languages (MB, HB, JH), pp. 142–154.
LATA-2011-Blanchet-SadriBZ #word
Unary Pattern Avoidance in Partial Words Dense with Holes (FBS, KB, AZ), pp. 155–166.
Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars (RB, HB), pp. 167–178.
LATA-2011-CaronCM #regular expression
Partial Derivatives of an Extended Regular Expression (PC, JMC, LM), pp. 179–191.
LATA-2011-CaseJLOSS #automation #learning #pattern matching #subclass
Automatic Learning of Subclasses of Pattern Languages (JC, SJ, TDL, YSO, PS, FS), pp. 192–203.
LATA-2011-CharlierDHS #finite
Finite Orbits of Language Operations (EC, MD, TH, JS), pp. 204–215.
Finitary Languages (KC, NF), pp. 216–226.
LATA-2011-ChatterjeeHH #complexity #game studies
The Complexity of Request-Response Games (KC, TAH, FH), pp. 227–237.
LATA-2011-ConleyK #algorithm #multi
Improved Alignment Based Algorithm for Multilingual Text Compression (ESC, STK), pp. 238–249.
LATA-2011-CorranHKT #automation #finite #monad
Singular Artin Monoids of Finite Coxeter Type Are Automatic (RC, MH, DK, RMT), pp. 250–261.
LATA-2011-DassowMT #network
Networks of Evolutionary Processors with Subregular Filters (JD, FM, BT), pp. 262–273.
LATA-2011-DelahayeLLPW #markov #problem
Decision Problems for Interval Markov Chains (BD, KGL, AL, MLP, AW), pp. 274–285.
LATA-2011-Gelderie #automaton #regular expression
Classifying Regular Languages via Cascade Products of Automata (MG), pp. 286–297.
LATA-2011-Hadravova #morphism
The Block Structure of Successor Morphisms (JH), pp. 298–309.
LATA-2011-Huschenbett #distributed #logic #modelling #multi
Models for Quantitative Distributed Systems and Multi-Valued Logics (MH), pp. 310–322.
LATA-2011-JansenHKN #normalisation
A Local Greibach Normal Form for Hyperedge Replacement Grammars (CJ, JH, JPK, TN), pp. 323–335.
Unique Small Subgraphs Are Not Easier to Find (MK, AL, EML), pp. 336–341.
LATA-2011-LabathR #information management #using
Simplifying DPDA Using Supplementary Information (PL, BR), pp. 342–353.
LATA-2011-LaurenceLNST #normalisation #top-down #transducer
Normalization of Sequential Top-Down Tree-to-Word Transducers (GL, AL, JN, SS, MT), pp. 354–365.
LATA-2011-LisitsaPS #automaton
Planarity of Knots, Register Automata and LogSpace Computability (AL, IP, RS), pp. 366–377.
Tarski’s Principle, Categorial Grammars and Learnability (JM), pp. 378–389.
Globally Deterministic CD-Systems of Stateless R(1)-Automata (BN, FO), pp. 390–401.
LATA-2011-NielsenH #parsing #regular expression
Bit-coded Regular Expression Parsing (LN, FH), pp. 402–413.
LATA-2011-OkhotinS #ambiguity #automaton #complexity #word
Descriptional Complexity of Unambiguous Nested Word Automata (AO, KS), pp. 414–426.
Avalanche Structure in the Kadanoff Sand Pile Model (KP, ER), pp. 427–439.
LATA-2011-PolicritiT #finite #set
Well-Quasi-Ordering Hereditarily Finite Sets (AP, AIT), pp. 440–451.
LATA-2011-Quaas #automaton #bound #on the #problem
On the Interval-Bound Problem for Weighted Timed Automata (KQ), pp. 452–464.
LATA-2011-ReidenbachS #memory management #scheduling #word
Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory Access (DR, MLS), pp. 465–476.
LATA-2011-RigoV #complexity #integer #set
Syntactic Complexity of Ultimately Periodic Sets of Integers (MR, ÉV), pp. 477–488.
LATA-2011-SalomaaSY #complexity
Undecidability of the State Complexity of Composed Regular Operations (AS, KS, SY), pp. 489–498.
LATA-2011-Schluter #automaton #lookahead
Restarting Automata with Auxiliary Symbols and Small Lookahead (NS), pp. 499–510.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.