Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8977)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): LATA: International Conference on Language and Automata Theory and Applications
Conference proceedings info: LATA 2015.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (58 papers)
-
Front Matter
-
Invited Talks
-
Front Matter
-
-
Algorithms
-
Front Matter
-
About this book
This book constitutes the refereed proceedings of the 9th International Conference on Language and Automata Theory and Applications, LATA 2015, held in Nice, France in March 2015. The 53 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 115 submissions. The papers cover the following topics: 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 networks, concurrency and Petri nets; automatic structures; cellular automata, codes, combinatorics on words; computational complexity; data and image compression; descriptional complexity; digital libraries and document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; parallel and regulated rewriting; parsing; patterns; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.
Keywords
- Algorithmic Learning
- Automata and Concurrency
- Automated Reasoning
- Backward Pattern Matching
- Combinatorics on Words
- Computational Complexity
- Data and Image Compression
- Decidability
- Distributional Learning
- Dynamical Systems
- Finite Automata
- Language Approximation
- Logic Programming
- Parameterized Complexity
- Recursive State Machines
- Regular Tree Automata
- SAT Solving
- Temporal Logic
- Term Rewriting
- Transducers
Editors and Affiliations
-
Rovira i Virgili University, Tarragona, Spain
Adrian-Horia Dediu
-
Nice Sophia Antipolis University, Sophia Antipolis, France
Enrico Formenti
-
Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain
Carlos Martín-Vide
-
Justus-Liebig-Universität, Gießen, Germany
Bianca Truthe
Bibliographic Information
Book Title: Language and Automata Theory and Applications
Book Subtitle: 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings
Editors: Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-15579-1
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Softcover ISBN: 978-3-319-15578-4Published: 10 March 2015
eBook ISBN: 978-3-319-15579-1Published: 23 February 2015
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XV, 754
Number of Illustrations: 140 b/w illustrations
Topics: Computation by Abstract Devices, Mathematical Logic and Formal Languages, Algorithm Analysis and Problem Complexity, Symbolic and Algebraic Manipulation, Discrete Mathematics in Computer Science, Artificial Intelligence