## Developments in Language Theory: 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010, ProceedingsYuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu The 14th International Conference on Developments in Language Theory (DLT 2010) was held in London, Ontario, Canada on the beautiful campus of the University of Western Ontario. It was a four-day conference starting August 17 and ending August 20, 2010. The DLT conference series is one of the major international conference series in language theory. It started in Turku, Finland in 1993. Initially, it was held onceeverytwoyears. Since2001, ithasbeenheldeveryyear, oddyearsinEurope and even years in other continents. The papers submitted to DLT 2010 were from 27 countries all over the world, which include Australia, Austria, Belgium, Canada, Czech Republic, Denmark, Finland, France, Germany, Hungary, Iceland, India, Italy, Japan, Latvia, Moldova, The Netherlands, Poland, Portugal, Russian Federation, S- vakia, South Korea, Spain, Sweden, Tunisia, UK, and the USA. Each paper was reviewed by three referees and discussed by the members of the Program C- mittee. Finally, 32 regular papers were selected by the Program Committee for presentation at the conference. There were six invited talks given at the c- ference. They were given by (in alphabetic order) Dora Giammarresi (Rome), MarkusHolzer (Giessen), OscarIbarra(Santa Barbara), Lila Kari(London, - tario), Michel Rigo (Liege), and Grzegorz Rozenber (Leiden). In addition, there were six posters on display at the conference. This volume includes all the 32 contributed papers, the papers or abstracts from the 6 invited speakers, and a 2-page abstract for each of the 6 poster papers. Wewarmlythankalltheinvitedspeakersandalltheauthorsofthesubmitted papers. Their e?orts were the bases of the success of the confere |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

### Common terms and phrases

accepting algebraic algorithm alphabet ambiguity automaton Berlin Heidelberg 2010 binary bisimulation Boolean Boolean grammars column Combinatorics complexity Computer Science concatenation conﬁguration consider construction context-free context-free grammars context-free languages decidable decision problems deﬁned Deﬁnition denoted deterministic diﬀerent encoding equations equivalent exists factor ﬁnal finite ﬁnite automata ﬁnite words ﬁrst formula function given grammars graph Heidelberg idempotent inﬁnite words input integer language equations Lemma length linear LNCS logic MCFG membrane Millstream system minimal monoid morphic morphism n-state nodes nondeterministic nonterminal normal form operations pattern pattern languages polynomial preﬁx Proof Proposition prove ranker recognizable regular expressions regular languages reset word resp restarting Salomaa satisﬁes semiring sequence solution Springer string subset symbol synchronizing Theorem theory tiling system transducer transition tree transducers Turing machine unambiguous unary undecidable union-free upper bound variables wxtt