Language and Automata Theory and Applications: 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011
Adrian-Horia Dediu, Carlos Martín-Vide, Shunsuke Inenaga
Springer Science & Business Media, May 19, 2011 - Computers - 512 pages
This book constitutes the refereed proceedings of the 5th International Conference on Language and Automata Theory and Applications, LATA 2011, held in Tarragona, Spain in May 2011. The 36 revised full papers presented together with four invited articles were carefully selected from 91 submissions. Among the topics covered are algebraic language theory, automata and logic, systems analysis, systems verifications, computational complexity, decidability, unification, graph transformations, language-based cryptography, and applications in data mining, computational learning, and pattern recognition.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abstract accepted algebraic algorithm alphabet automatic structures automaton binary bound Büchi automaton cellular automata complexity Computer Science configuration conic set consider construction context-free context-free languages corresponding Dediu deduce defined Definition denote derivative deterministic digraph edge elements Example exists factor finitary finite automata finite set function Gauss word given grammars graph Heidelberg Hence IMCs induction infinite input integer introduce isomorphic labels learner Lemma length linear LNCS minimal monoid morphisms mutation nested word node nondeterministic numeration system occurrence operations pair parse tree pattern languages periodic set picture languages polynomial prefix problem Proof properties prove recognized regular expression regular languages relation request-response reset rule sequence shuffle word Springer star-free star-free languages string subgraphs subset suffix symbol syntactic syntactic monoid tape Theorem theory transition tree Turing machines vector vertex vertices