Adrian Horia Dediu, Carlos Martín-Vide, Bianca Truthe
Proceedings of the Seventh International Conference on Language and Automata Theory and Applications
LATA, 2013.
@proceedings{LATA-2013,
address = "Bilbao, Spain",
doi = "10.1007/978-3-642-37064-9",
editor = "Adrian Horia Dediu and Carlos Martín-Vide and Bianca Truthe",
isbn = "978-3-642-37063-2",
publisher = "{Springer International Publishing}",
series = "{Lecture Notes in Computer Science}",
title = "{Proceedings of the Seventh International Conference on Language and Automata Theory and Applications}",
volume = 7810,
year = 2013,
}
Contents (50 items)
- LATA-2013-Cai #complexity #problem
- Complexity Dichotomy for Counting Problems (JYC), pp. 1–11.
- LATA-2013-Etessami #algorithm #infinity #probability #recursion #verification
- Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems (KE), p. 12.
- LATA-2013-Ong #automaton #higher-order #model checking #recursion
- Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking (LO), pp. 13–41.
- LATA-2013-Ouaknine #linear
- Discrete Linear Dynamical Systems (JO), p. 42.
- LATA-2013-Schwentick #automaton #challenge #xml
- XML Schema Management: A Challenge for Automata Theory (TS), p. 43.
- LATA-2013-AlurKTY #complexity #graph #on the #problem
- On the Complexity of Shortest Path Problems on Discounted Cost Graphs (RA, SK, KT, YY), pp. 44–55.
- LATA-2013-AotoI #calculus #rule-based #termination
- Termination of Rule-Based Calculi for Uniform Semi-Unification (TA, MI), pp. 56–67.
- LATA-2013-AtminasLM
- Deciding WQO for Factorial Languages (AA, VVL, MM), pp. 68–79.
- LATA-2013-BabaaliK #automaton #on the #product line
- On the Construction of a Family of Automata That Are Generically Non-minimal (PB, CK), pp. 80–91.
- LATA-2013-BalaJ #automaton #nondeterminism
- Limited Non-determinism Hierarchy of Counter Automata (SB, DJ), pp. 92–103.
- LATA-2013-BalaK #ambiguity #automaton
- Unambiguous Automata Denoting Finitely Sequential Functions (SB, AK), pp. 104–115.
- LATA-2013-BenzaidDE #algorithm #complexity
- Duplication-Loss Genome Alignment: Complexity and Algorithm (BB, RD, NEM), pp. 116–127.
- LATA-2013-BiondiLNW #markov #process
- Maximizing Entropy over Markov Processes (FB, AL, BFN, AW), pp. 128–140.
- LATA-2013-BjorklundFK #automaton #learning
- MAT Learning of Universal Automata (JB, HF, AK), pp. 141–152.
- LATA-2013-Blanchet-SadriBFH #approach #graph #polynomial
- A Graph Polynomial Approach to Primitivity (FBS, MB, NF, JH), pp. 153–164.
- LATA-2013-Blanchet-SadriL #problem #word
- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem (FBS, JL), pp. 165–176.
- LATA-2013-BolligCHKS #automaton #branch #communication
- Dynamic Communicating Automata and Branching High-Level MSCs (BB, AC, LH, AK, TS), pp. 177–189.
- LATA-2013-BruyereDG #anti #automaton
- Visibly Pushdown Automata: Universality and Inclusion via Antichains (VB, MD, OG), pp. 190–201.
- LATA-2013-ChamparnaudDJM #regular expression
- Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions (JMC, JPD, HJ, LM), pp. 202–213.
- LATA-2013-ChatterjeeCR #how
- How to Travel between Languages (KC, SC, SR), pp. 214–225.
- LATA-2013-CuiDFI #automaton #execution
- Execution Information Rate for Some Classes of Automata (CC, ZD, TRF, OHI), pp. 226–237.
- LATA-2013-DelzannoT #complexity #decidability #network #verification
- Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks (GD, RT), pp. 238–249.
- LATA-2013-DengZDZ #concurrent #π-calculus
- The Buffered π-Calculus: A Model for Concurrent Languages (XD, YZ, YD, FZ), pp. 250–261.
- LATA-2013-EndrullisGH #sequence
- Mix-Automatic Sequences (JE, CG, DH), pp. 262–274.
- LATA-2013-FernauHV #analysis #automaton #multi #problem
- A Multivariate Analysis of Some DFA Problems (HF, PH, YV), pp. 275–286.
- LATA-2013-FreivaldsZP #automaton #complexity #on the
- On the Size Complexity of Deterministic Frequency Automata (RF, TZ, GRP), pp. 287–298.
- LATA-2013-GocMS #on the
- On the Number of Unbordered Factors (DG, HM, JS), pp. 299–310.
- LATA-2013-GocSS #automation #sequence #word
- Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences (DG, KS, JS), pp. 311–322.
- LATA-2013-HaberHMMR #performance #regular expression
- Efficient Submatch Extraction for Practical Regular Expressions (SH, WH, PKM, MM, PR), pp. 323–334.
- LATA-2013-HashimotoSISF #bottom-up #transducer
- Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers (KH, RS, YI, HS, TF), pp. 335–346.
- LATA-2013-HutagalungLL #automaton #game studies #simulation
- Revealing vs. Concealing: More Simulation Games for Büchi Inclusion (MH, ML, ÉL), pp. 347–358.
- LATA-2013-IbarraR #automaton #bound #on the
- On Bounded Languages and Reversal-Bounded Automata (OHI, BR), pp. 359–370.
- LATA-2013-JacquemardR #automaton #term rewriting
- Rewrite Closure and CF Hedge Automata (FJ, MR), pp. 371–382.
- LATA-2013-KociumakaRRW #algorithm #linear #testing
- Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing (TK, JR, WR, TW), pp. 383–394.
- LATA-2013-LaugerotteSZ #automaton
- From Regular Tree Expression to Position Tree Automaton (ÉL, NOS, DZ), pp. 395–406.
- LATA-2013-LuttenbergerS #commutative #convergence
- Convergence of Newton’s Method over Commutative Semirings (ML, MS), pp. 407–418.
- LATA-2013-MerweFG #difference #symmetry
- Counting Minimal Symmetric Difference NFAs (BvdM, MF, JG), pp. 419–430.
- LATA-2013-MontanariS #logic #regular expression
- Interval Logics and ωB-Regular Languages (AM, PS), pp. 431–443.
- LATA-2013-NakamuraI #automaton #linear #stack
- Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars (KN, KI), pp. 444–455.
- LATA-2013-Otto #automaton
- Asynchronous PC Systems of Pushdown Automata (FO), pp. 456–467.
- LATA-2013-Quaas #automaton #logic #metric #model checking
- Model Checking Metric Temporal Logic over Automata with One Counter (KQ), pp. 468–479.
- LATA-2013-RotBR #equivalence #induction #proving
- Coinductive Proof Techniques for Language Equivalence (JR, MMB, JJMMR), pp. 480–492.
- LATA-2013-Schaeffer #word
- Ostrowski Numeration and the Local Period of Sturmian Words (LS), pp. 493–503.
- LATA-2013-SelivanovK #algebra
- Boolean Algebras of Regular ω-Languages (VLS, AK), pp. 504–515.
- LATA-2013-Shamir
- Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars (ES), pp. 516–522.
- LATA-2013-SippuS #multi #online
- Online Matching of Multiple Regular Patterns with Gaps and Character Classes (SS, ESS), pp. 523–534.
- LATA-2013-Smith #bound
- Infiniteness and Boundedness in 0L, DT0L, and T0L Systems (TS), pp. 535–546.
- LATA-2013-Souza #transducer
- Uniformisation of Two-Way Transducers (RdS), pp. 547–558.
- LATA-2013-Tveretina #bound
- A Conditional Superpolynomial Lower Bound for Extended Resolution (OT), pp. 559–569.
- LATA-2013-ZakS #distance #turing machine
- A Turing Machine Distance Hierarchy (SZ, JS), pp. 570–578.
18 ×#automaton
5 ×#complexity
5 ×#on the
4 ×#problem
3 ×#algorithm
3 ×#bound
3 ×#linear
3 ×#regular expression
3 ×#word
2 ×#graph
5 ×#complexity
5 ×#on the
4 ×#problem
3 ×#algorithm
3 ×#bound
3 ×#linear
3 ×#regular expression
3 ×#word
2 ×#graph