TY  - BOOK
AU  - Dediu,Adrian-Horia
AU  - Janou?ek,Jan
AU  - Martín-Vide,Carlos
AU  - Truthe,Bianca
ED  - SpringerLink (Online service)
TI  - Language and Automata Theory and Applications: 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783319300009
AV  - Q334-342 
U1  - 006.3 23
PY  - 2016///
CY  - Cham
PB  - Springer International Publishing, Imprint: Springer
KW  - Computer science
KW  - Computers
KW  - Algorithms
KW  - Mathematical logic
KW  - Mathematics
KW  - Artificial intelligence
KW  - Computer Science
KW  - Artificial Intelligence (incl. Robotics)
KW  - Computation by Abstract Devices
KW  - Mathematical Logic and Formal Languages
KW  - Algorithm Analysis and Problem Complexity
KW  - Symbolic and Algebraic Manipulation
KW  - Discrete Mathematics in Computer Science
N2  - 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
UR  - http://148.231.10.114:2048/login?url=http://dx.doi.org/10.1007/978-3-319-30000-9
ER  -