Clelia de Felice, Antonio Restivo
Proceedings of the Ninth International Conference on Developments in Language Theory
DLT, 2005.
@proceedings{DLT-2005, address = "Palermo, Italy", editor = "Clelia de Felice and Antonio Restivo", isbn = "3-540-26546-5", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the Ninth International Conference on Developments in Language Theory}", volume = 3572, year = 2005, }
Contents (35 items)
- DLT-2005-AlloucheS #morphism #strict
- Restricted Towers of Hanoi and Morphisms (JPA, AS), pp. 1–10.
- DLT-2005-AnanichevPV #word
- Collapsing Words: A Progress Report (DSA, IVP, MVV), pp. 11–21.
- DLT-2005-BatuS #approximate #consistency #parsing #string
- Locally Consistent Parsing and Applications to Approximate String Comparisons (TB, SCS), pp. 22–35.
- DLT-2005-CarpiL #word
- Central Sturmian Words: Recent Developments (AC, AdL), pp. 36–56.
- DLT-2005-Kari #automaton
- Reversible Cellular Automata (JK), pp. 57–68.
- DLT-2005-Straubing #regular expression
- Inexpressibility Results for Regular Languages in Nonregular Settings (HS), pp. 69–77.
- DLT-2005-AblayevG #automaton #complexity #quantum
- Complexity of Quantum Uniform and Nonuniform Automata (FMA, AG), pp. 78–87.
- DLT-2005-AfoninH #problem #regular expression #set
- Membership and Finiteness Problems for Rational Sets of Regular Languages (SA, EH), pp. 88–99.
- DLT-2005-AlhazovFO
- Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells (AA, RF, MO), pp. 100–111.
- DLT-2005-Ananichev #automaton
- The Mortality Threshold for Partially Monotonic Automata (DSA), pp. 112–121.
- DLT-2005-AraujoB #word
- Sturmian Words: Dynamical Systems and Derivated Words (IMA, VB), pp. 122–133.
- DLT-2005-BedonR #linear #order #theorem #word
- Schützenberger and Eilenberg Theorems for Words on Linear Orderings (NB, CR), pp. 134–145.
- DLT-2005-BellP #matrix #on the
- On the Membership of Invertible Diagonal Matrices (PB, IP), pp. 146–157.
- DLT-2005-BesC #linear #order #theorem #word
- A Kleene Theorem for Languages of Words Indexed by Linear Orderings (AB, OC), pp. 158–167.
- DLT-2005-BordihnHK #automaton #finite
- Revolving-Input Finite Automata (HB, MH, MK), pp. 168–179.
- DLT-2005-BorelR #word
- Some New Results on Palindromic Factors of Billiard Words (JPB, CR), pp. 180–188.
- DLT-2005-BrlekLL
- A Note on a Result of Daurat and Nivat (SB, GL, AL), pp. 189–198.
- DLT-2005-LucaL #word
- Palindromes in Sturmian Words (AdL, ADL), pp. 199–208.
- DLT-2005-ElkharratF
- Voronoi Cells of β-Integers (AE, CF), pp. 209–223.
- DLT-2005-EpifanioGM #approximate
- Languages with Mismatches and an Application to Approximate Indexing (CE, AG, FM), pp. 224–235.
- DLT-2005-Fernique #sequence
- Bidimensional Sturmian Sequences and Substitutions (TF), pp. 236–247.
- DLT-2005-FreydenbergerRS #ambiguity #image #string
- Unambiguous Morphic Images of Strings (DDF, DR, JCS), pp. 248–259.
- DLT-2005-GeffertMP #automaton #finite
- Complementing Two-Way Finite Automata (VG, CM, GP), pp. 260–271.
- DLT-2005-GruberHKK #automaton #on the
- On Timed Automata with Discrete Time — Structural and Language Theoretical Characterization (HG, MH, AK, BK), pp. 272–283.
- DLT-2005-JurdzinskiMOP
- Monotone Deterministic RL-Automata Don’t Need Auxiliary Symbols (TJ, FM, FO, MP), pp. 284–295.
- DLT-2005-KariKST #on the #word
- On Hairpin-Free Words and Languages (LK, SK, PS, GT), pp. 296–307.
- DLT-2005-Karianto #automaton #graph
- Adding Monotonic Counters to Automata and Transition Graphs (KW), pp. 308–319.
- DLT-2005-Kortelainen #generative #polynomial #recursion
- Polynomial Generators of Recursively Enumerable Languages (JK), pp. 320–326.
- DLT-2005-Kunc #on the #set
- On Language Inequalities XK subset of LX (MK), pp. 327–337.
- DLT-2005-Maletti #power of #transducer
- The Power of Tree Series Transducers of Type I and II (AM), pp. 338–349.
- DLT-2005-Massazza #ambiguity #problem
- The Inclusion Problem for Unambiguous Rational Trace Languages (PM), pp. 350–361.
- DLT-2005-Okhotin #boolean grammar #lr #parsing
- LR Parsing for Boolean Grammars (AO), pp. 362–373.
- DLT-2005-Pribavkina #on the #word
- On Some Properties of the Language of 2-Collapsing Words (EVP), pp. 374–384.
- DLT-2005-Priese #graph #set
- Semi-rational Sets of DAGs (LP), pp. 385–396.
- DLT-2005-Saari #on the #sequence
- On the Frequency of Letters in Pure Binary Morphic Sequences (KS), pp. 397–408.
9 ×#word
7 ×#automaton
6 ×#on the
3 ×#set
2 ×#ambiguity
2 ×#approximate
2 ×#finite
2 ×#graph
2 ×#linear
2 ×#order
7 ×#automaton
6 ×#on the
3 ×#set
2 ×#ambiguity
2 ×#approximate
2 ×#finite
2 ×#graph
2 ×#linear
2 ×#order