Language and Automata Theory and Applications

Language and Automata Theory and Applications

4.11 - 1251 ratings - Source

These proceedings contain most of the papers that werepresented at the Second International Conference on Language and Automata Theory and Applications (LATA 2008), held in Tarragona, Spain, during March 13-19, 2008. The scope of LATA is rather broad, including: words, languages and - tomata; grammars (Chomsky hierarchy, contextual, multidimensional, uni?- tion, categorial, etc. );grammarsandautomataarchitectures;extendedautomata; combinatorics on words; language varieties and semigroups; algebraic language theory; computability; computational, descriptional, and parameterized c- plexity;decidability questions onwordsandlanguages;patterns andcodes;s- bolic dynamics; regulated rewriting; trees, tree languages and tree machines; term rewriting; graphs and graph transformation; power series; fuzzy and rough languages; cellular automata; DNA and other models of bio-inspired comp- ing; quantum, chemical and optical computing; biomolecular nanotechnology; automata and logic; algorithms on automata and words; automata for s- tem analysis and program veri?cation; automata, concurrency and Petri nets; parsing; weighted machines; transducers; foundations of ?nite state technology; grammatical inference and algorithmic learning; text retrieval, pattern mat- ing and pattern recognition; text algorithms; string and combinatorial issues in computationalbiologyandbioinformatics;mathematicalevolutionarygenomics; language-based cryptography; data and image compression; circuits and n- works; language-theoretic foundations of arti?cial intelligence and arti?cial life; digital libraries; and document engineering. LATA 2008 received 134 submissions. Each of them was reviewed by at least three Program Committee members plus, in most cases, by additional external referees. After a thorough and vivid evaluation phase the committee decided to accept 40 papers (which means an acceptance rate of 29. 85%Introduction. Minimization of deterministic finite automata is a largely studied problem of the Theory of Automata and Formal Languages. It consists in finding the unique (up to isomorphism) minimal deterministic automaton recognizing a set ofanbsp;...

Title:Language and Automata Theory and Applications
Author:Carlos Martin-Vide, Friedrich Otto, Henning Fernau
Publisher:Springer Science & Business Media - 2008-10-08


You Must CONTINUE and create a free account to access unlimited downloads & streaming