Language and Automata Theory and Applications - 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings

This book constitutes the refereed proceedings of the 10th InternationalConference on Language and Automata Theory and Applications, LATA 2016, held inPrague, Czech Republic, in March 2016.
The 42 revised full papers presented together with 5 invited talks werecarefully reviewed and selected from 119 submissions. The papers cover thefollowing topics: algebraic language theory; algorithms for semi-structureddata mining, algorithms on automata and words; automata and logic; automata forsystem analysis and program verification; automata networks, concurrency andPetri nets; automatic structures; cellular automata, codes, combinatorics onwords; computational complexity; data and image compression; descriptionalcomplexity; digital libraries and document engineering; foundations of finitestate technology; foundations of XML; fuzzy and rough languages; grammaticalinference and algorithmic learning; graphs and graph transformation; languagevarieties 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.

Summary

This book constitutes the refereed proceedings of the 10th International
Conference on Language and Automata Theory and Applications, LATA 2016, held in
Prague, Czech Republic, in March 2016.
The 42 revised full papers presented together with 5 invited talks were
carefully reviewed and selected from 119 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.

Product details

• Assisted by: Adrian-Horia Dediu (Editor), Jan Janou¿ek (Editor), Ja Janousek (Editor), Jan Janousek (Editor), Jan Janoušek (Editor), Carlos Martín-Vide (Editor), Carlos Martín-Vide et al (Editor), Bianca Truthe (Editor)
• Publisher: Springer, Berlin
• Languages: English
• Product format: Paperback / Softback
• Released: 01.01.2016
• EAN: 9783319299990
• ISBN: 978-3-31-929999-0
• No. of pages: 618
• Dimensions: 155 mm x 236 mm x 37 mm
• Weight: 977 g
• Illustrations: XXII, 618 p. 75 illus. in color.
• Series: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Theoretical Computer Science and General Issues
• Subjects: Natural sciences, medicine, IT, technology > IT, data processing > IT; C, Algorithmen und Datenstrukturen, Algorithms, Artificial Intelligence, Diskrete Mathematik, Theoretische Informatik, Mathematik für Informatiker, computer science, Theory of Computation, Discrete Mathematics in Computer Science, Discrete Mathematics, Computers, Algorithms & data structures, Mathematical theory of computation, Computer science—Mathematics, Maths for computer scientists, Algorithm Analysis and Problem Complexity, Mathematical logic, Mathematical Logic and Formal Languages, Symbolic and Algebraic Manipulation, Computation by Abstract Devices, Formal Languages and Automata Theory, Transducers, program verification