Language and Automata Theory and Applications (eBook, PDF)

9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings
Redaktion: Dediu, Adrian-Horia; Truthe, Bianca; Martín-Vide, Carlos; Formenti, Enrico

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer International Publishing
• Seitenzahl: 754
• Erscheinungstermin: 23. Februar 2015
• Englisch
• ISBN-13: 9783319155791
• Artikelnr.: 44126550

Inhaltsangabe

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.