E-book
Language and Automata Theory and Applications [electronic resource] : 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings / edited by Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe.
Record details
- ISBN: 9783642370649
- Physical Description: XIV, 580 p. 69 illus. online resource.
- Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : 2013.
Search for related items by subject
Search for related items by series
Other Formats and Editions
Electronic resources
| Complexity Dichotomy for Counting Problems.- Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems.- Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking.- Discrete Linear Dynamical Systems.- XML Schema Management: A Challenge for Automata Theory | ||
| ^ | ||
| On the Complexity of Shortest Path Problems on Discounted Cost Graphs.- Termination of Rule-Based Calculi for Uniform Semi-Unification.- Deciding WQO for Factorial Languages.- On the Construction of a Family of Automata That Are Generically Non-minimal.- Limited Non-determinism Hierarchy of Counter Automata.- Unambiguous Automata Denoting Finitely Sequential Functions.- Duplication-Loss Genome Alignment: Complexity and Algorithm.- Maximizing Entropy over Markov Processes.- MAT Learning of Universal Automata.- A Graph Polynomial Approach to Primitivity.- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem.- Dynamic Communicating Automata and Branching High-Level MSCs.- Visibly Pushdown Automata: Universality and Inclusion via Antichains | ||
| ^ | ||
| ^^ | ||
| Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions.- How to Travel between Languages.- Execution Information Rate for Some Classes of Automata.- Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks.- The Buffered Ï-Calculus: A Model for Concurrent Languages.- Mix-Automatic Sequences.- A Multivariate Analysis of Some DFA Problems | ||
| On the Size Complexity of Deterministic Frequency Automata | ||
| On the Number of Unbordered Factors | ||
| Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences.- Efficient Submatch Extraction for Practical Regular Expressions.- Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers | ||
| ^ | ||
| ^^ | ||
| Revealing vs. Concealing: More Simulation Games for Büchi Inclusion.- On Bounded Languages and Reversal-Bounded Automata.- Rewrite Closure and CF Hedge Automata.- Linear-Time Version of Holubâs Algorithm for Morphic Imprimitivity Testing.-From Regular Tree Expression to Position Tree Automaton | ||
| Convergence of Newtonâs Method over Commutative Semirings | ||
| Counting Minimal Symmetric Difference NFAs | ||
| Interval Logics and ÏB-Regular Languages.- Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars.- Asynchronous PC Systems of Pushdown Automata | ||
| ^ | ||
| ^^ | ||
| Model Checking Metric Temporal Logic over Automata with One Counter.- Coinductive Proof Techniques for Language Equivalence.- Ostrowski Numeration and the Local Period of Sturmian Words.- Boolean Algebras of Regular Ï-Languages.- Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars.- Online Matching of Multiple Regular Patterns with Gaps and Character Classes.- Infiniteness and Boundedness in 0L, DT0L, and T0L Systems.- Uniformisation of Two-Way Transducers.- A Conditional Superpolynomial Lower Bound for Extended Resolution | ||
| A Turing Machine Distance Hierarchy.Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems.- Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking.- Discrete Linear Dynamical Systems.- XML Schema Management: A Challenge for Automata Theory | ||
| ^ | ||
| ^^ | ||
| On the Complexity of Shortest Path Problems on Discounted Cost Graphs.- Termination of Rule-Based Calculi for Uniform Semi-Unification.- Deciding WQO for Factorial Languages.- On the Construction of a Family of Automata That Are Generically Non-minimal.- Limited Non-determinism Hierarchy of Counter Automata.- Unambiguous Automata Denoting Finitely Sequential Functions.- Duplication-Loss Genome Alignment: Complexity and Algorithm.- Maximizing Entropy over Markov Processes.- MAT Learning of Universal Automata.- A Graph Polynomial Approach to Primitivity.- Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem.- Dynamic Communicating Automata and Branching High-Level MSCs.- Visibly Pushdown Automata: Universality and Inclusion via Antichains | ||
| ^ | ||
| ^^ | ||
| Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions.- How to Travel between Languages.- Execution Information Rate for Some Classes of Automata.- Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks.- The Buffered Ï-Calculus: A Model for Concurrent Languages.- Mix-Automatic Sequences.- A Multivariate Analysis of Some DFA Problems | ||
| On the Size Complexity of Deterministic Frequency Automata | ||
| On the Number of Unbordered Factors | ||
| Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences.- Efficient Submatch Extraction for Practical Regular Expressions.- Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers | ||
| ^ | ||
| ^^ | ||
| Revealing vs. Concealing: More Simulation Games for Büchi Inclusion.- On Bounded Languages and Reversal-Bounded Automata.- Rewrite Closure and CF Hedge Automata.- Linear-Time Version of Holubâs Algorithm for Morphic Imprimitivity Testing.-From Regular Tree Expression to Position Tree Automaton | ||
| Convergence of Newtonâs Method over Commutative Semirings | ||
| Counting Minimal Symmetric Difference NFAs | ||
| Interval Logics and ÏB-Regular Languages.- Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars.- Asynchronous PC Systems of Pushdown Automata | ||
| ^ | ||
| ^^ | ||
| Model Checking Metric Temporal Logic over Automata with One Counter.- Coinductive Proof Techniques for Language Equivalence.- Ostrowski Numeration and the Local Period of Sturmian Words.- Boolean Algebras of Regular Ï-Languages.- Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars.- Online Matching of Multiple Regular Patterns with Gaps and Character Classes.- Infiniteness and Boundedness in 0L, DT0L, and T0L Systems.- Uniformisation of Two-Way Transducers.- A Conditional Superpolynomial Lower Bound for Extended Resolution | ||
| A Turing Machine Distance Hierarchy. | ||
| ^^ |
