Development in Language Theory: 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings
Giancarlo Mauri, Alberto Leporati
Springer Science & Business Media, Jul 12, 2011 - Computers - 482 pages
This book constitutes the refereed proceedings of the 15th International Conference on Developments in Language Theory, DLT 2011, held in Milano, Italy, in July 2011. The 34 regular papers presented were carefully reviewed and selected from numerous submissions. The volume also contains the papers or abstracts of 5 invited speakers, as well as a 2-page abstract for each of the 7 poster papers. The topics covered include grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; codes; symbolic dynamics; algorithmic, combinatorial and algebraic properties of words and languages; decidability questions; applications of language theory, including: natural computing, image manipulation and compression, text algorithms, cryptography, concurrency, complexity theory and logic; cellular automata and multidimensional patterns; language theory aspects of quantum computing and bio-computing.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
2DFA 2OTA abelian accepting algorithm alphabet ANEP antimorphism atoms automaton Berlin Heidelberg 2011 binary words cellular automata characterization Combinatorics complexity component Computer Science configuration consider construction contains context-free languages Corollary defined definition denote deterministic deterministic finite automaton equivalent exists finite automata finite set finite-crossing formal language function given grammar graph Hamiltonian path Heidelberg infinite word input head integer labeled Lemma Leporati Eds letters linear ordering LNCS Lyndon words minimal DFA mod fc monoid morphism multisets node non-empty nondeterministic nonterminal NP-complete obtained occurrences one-unambiguous operation overlap-free word pair palindromes partial word path polynomial polyominoes prefix normal problem Proof Proposition prove quotient reachability regular expressions regular languages restarting automata result semigroup sequence simulation Springer string subset suffix symbol syntactic syntactic monoid Theorem transformation two-way upper bound