04686nam 22008655 450 99619874420331620230221184244.03-319-15579-210.1007/978-3-319-15579-1(CKB)3710000000360321(SSID)ssj0001452222(PQKBManifestationID)11834526(PQKBTitleCode)TC0001452222(PQKBWorkID)11479688(PQKB)11157777(DE-He213)978-3-319-15579-1(MiAaPQ)EBC6298328(MiAaPQ)EBC5576740(Au-PeEL)EBL5576740(OCoLC)904398329(PPN)18449740X(EXLCZ)99371000000036032120150223d2015 u| 0engurnn#008mamaatxtccrLanguage and Automata Theory and Applications[electronic resource] 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings /edited by Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe1st ed. 2015.Cham :Springer International Publishing :Imprint: Springer,2015.1 online resource (XV, 754 p. 140 illus.)Theoretical Computer Science and General Issues,2512-2029 ;8977Bibliographic Level Mode of Issuance: Monograph3-319-15578-4 Includes bibliographical references and index.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.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.Theoretical Computer Science and General Issues,2512-2029 ;8977Computer scienceMachine theoryAlgorithmsComputer science—MathematicsDiscrete mathematicsArtificial intelligenceTheory of ComputationFormal Languages and Automata TheoryAlgorithmsSymbolic and Algebraic ManipulationDiscrete Mathematics in Computer ScienceArtificial IntelligenceComputer science.Machine theory.Algorithms.Computer science—Mathematics.Discrete mathematics.Artificial intelligence.Theory of Computation.Formal Languages and Automata Theory.Algorithms.Symbolic and Algebraic Manipulation.Discrete Mathematics in Computer Science.Artificial Intelligence.004Dediu Adrian-Horiaedthttp://id.loc.gov/vocabulary/relators/edtFormenti Enricoedthttp://id.loc.gov/vocabulary/relators/edtMartín-Vide Carlosedthttp://id.loc.gov/vocabulary/relators/edtTruthe Biancaedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK996198744203316Language and Automata Theory and Applications774044UNISA