1 option
Language and Automata Theory and Applications : 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings / edited by Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 8977
- Theoretical Computer Science and General Issues, 2512-2029 ; 8977
- Language:
- English
- Subjects (All):
- Computer science.
- Machine theory.
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Artificial intelligence.
- Theory of Computation.
- Formal Languages and Automata Theory.
- Symbolic and Algebraic Manipulation.
- Discrete Mathematics in Computer Science.
- Artificial Intelligence.
- Local Subjects:
- Theory of Computation.
- Formal Languages and Automata Theory.
- Algorithms.
- Symbolic and Algebraic Manipulation.
- Discrete Mathematics in Computer Science.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (XV, 754 pages) : 140 illustrations
- Edition:
- 1st ed. 2015.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2015.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- Algorithms
- Automata, Logic, and Concurrency
- Codes, Semigroups, and Symbolic Dynamics
- Combinatorics on Words
- Complexity and Recursive Functions
- Compression, Inference, Pattern Matching, and Model Checking
- Graphs, Term Rewriting, and Networks
- Transducers, Tree Automata, and Weighted Automata.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-15579-1
- 9783319155791
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.