Language and Automata Theory and Applications, 2013 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013, Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Dediu Adrian-Horia, Martín-Vide Carlos, Truthe Bianca
The 45 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 97 initial submissions. The volume features contributions from both classical theory fields and application areas (bioinformatics, systems biology, language technology, artificial intelligence, etc.). Among the topics covered are algebraic language theory; algorithms for semi-structured data mining; algorithms on automata and words; automata and logic; automata for system analysis and program verification; automata, concurrency and Petri nets; automatic structures; cellular automata; combinatorics on words; computability; computational complexity; computational linguistics; data and image compression; decidability questions on words and languages; descriptional complexity; DNA and other models of bio-inspired computing; document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammars (Chomsky hierarchy, contextual, multidimensional, unification, categorial, etc.); grammars and automata architectures; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; language-based cryptography; language-theoretic foundations of artificial intelligence and artificial life; parallel and regulated rewriting; parsing; pattern recognition; patterns and codes; power series; quantum, chemical and optical computing; semantics; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; symbolic neural networks; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.
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.Fast track conference proceedings
Unique visibility
State of the art research
Date de parution : 02-2013
Ouvrage de 580 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 52,74 €
Ajouter au panier
