Language and Automata Theory and Applications
7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013, Proceedings
Editors: Dediu, Adrian-Horia, Martín-Vide, Carlos, Truthe, Bianca (Eds.)
Free Preview- Fast track conference proceedings
- Unique visibility
- State of the art research
Buy this book
- About this book
-
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 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.
- Table of contents (50 chapters)
-
-
Complexity Dichotomy for Counting Problems
Pages 1-11
-
Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic Systems
Pages 12-12
-
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking
Pages 13-41
-
Discrete Linear Dynamical Systems
Pages 42-42
-
XML Schema Management: A Challenge for Automata Theory
Pages 43-43
-
Table of contents (50 chapters)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Language and Automata Theory and Applications
- Book Subtitle
- 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013, Proceedings
- Editors
-
- Adrian-Horia Dediu
- Carlos Martín-Vide
- Bianca Truthe
- Series Title
- Theoretical Computer Science and General Issues
- Series Volume
- 7810
- Copyright
- 2013
- Publisher
- Springer-Verlag Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- eBook ISBN
- 978-3-642-37064-9
- DOI
- 10.1007/978-3-642-37064-9
- Softcover ISBN
- 978-3-642-37063-2
- Edition Number
- 1
- Number of Pages
- XIV, 580
- Number of Illustrations
- 69 b/w illustrations
- Topics
