Screen LibraryLanguage and automata theory and applications : 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings /
This book constitutes the refereed proceedings of the 7th International Conference on Language and Automata Theory and Applications, LATA 2013, held in Bilbao, Spain in April 2013. The 45 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 97 initial...
Saved in:
| Corporate Authors: | ; |
|---|---|
| Group Author: | ; ; |
| Published: |
Springer,
|
| Publisher Address: | Berlin ; New York : |
| Publication Dates: | 2013. |
| Literature type: | eBook |
| Language: | English |
| Series: |
Lecture notes in computer science,
7810 LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Subjects: | |
| Online Access: |
http://dx.doi.org/10.1007/978-3-642-37064-9 |
| Summary: |
This book constitutes the refereed proceedings of the 7th International Conference on Language and Automata Theory and Applications, LATA 2013, held in Bilbao, Spain in April 2013. 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 verifiation; 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 artifi- cial 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. |
| Item Description: |
International conference proceedings. Includes author index. |
| Carrier Form: | 1 online resource (xiv, 580 pages) : illustrations. |
| ISBN: |
9783642370649 (electronic bk.) 3642370640 (electronic bk.) |
| Index Number: | QA267 |
| CLC: | TP312-532 |
| Contents: |
Invited Talks. 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 / Regular Papers. 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 / |