Language and Automata Theory and Applications: 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010, Proceedings
Carlos Martin-Vide, Adrian Horia Dediu, Henning Fernau
Springer Science & Business Media, May 10, 2010 - Computers - 622 pages
These proceedings containall the papers that werepresented at the 4th Inter- tional Conference on Language and Automata Theory and Applications (LATA 2010), held in Trier, Germany, during May 24-28, 2010. The scope of LATA is rather broad, including: algebraic language theory; algorithms on automata and words; automata and logic; automata for system analysis and program veri?cation; automata, concurrency and Petri nets; cel- lar automata; combinatorics on words; computability; computational compl- ity; computer linguistics; data and image compression; decidability questions on words and languages; descriptional complexity; DNA and other models of bio-inspired computing; document engineering; foundations of ?nite state te- nology; fuzzy and rough languages; grammars (Chomsky hierarchy, contextual, multidimensional, uni?cation, categorial, etc. ); grammars and automata arc- tectures; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; language-based cryptog- phy; language-theoretic foundations of arti?cial intelligence and arti?cial life; neuralnetworks;parallelandregulatedrewriting;parsing;patternmatching and pattern recognition; patterns and codes; power series; quantum, chemical and optical computing; semantics; string and combinatorial issues in computational biology and bioinformatics; symbolic dynamics; term rewriting; text algorithms; textretrieval;transducers;trees, treelanguagesandtreemachines;andweighted machines. LATA 2010 received 115 submissions, many among them of good quality. Each one was reviewed by at least three Program Committee members plus, in mostcases, byadditionalexternalreferees. Afterathoroughandvividdiscussion phase, the committee decided to accept 47 papers (which means an acceptance rate of 40. 86%). The conference program also included four invited talks.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
abelian square abelian square-free accepting algorithm alignment alphabet applied assume automaton Bšuchi automata binary categorial grammars clitic closure CLP(R complexity Computer Science conﬁguration consider construction contains context-free languages corresponding cubic runs Dediu deﬁned Deﬁnition denote deterministic diﬀerent Dyck language eﬃcient encoding equivalent example exists extended factor Fernau ﬁnal ﬁnding ﬁnite ﬁnite set ﬁrst ﬁxed formal formula function given graph Heidelberg hole iﬀ inﬁnite input integer iterative learnable learner Lemma length letter linear LNCS logic longest common matching microRNA Muller automaton neuron node nondeterministic nonterminal notation NP-complete NP-hard occurrences operations pair parameter partial words path pattern polynomial preﬁx pregroup problem Proof properties Proposition pushdown automata regular expressions regular languages RFSA rules satisﬁes simulate speciﬁc Springer square-free string structure subset subtree suﬃx symbol Theorem transition tree types variables