default search action
18th DLT 2014: Ekaterinburg, Russia
- Arseny M. Shur, Mikhail V. Volkov:
Developments in Language Theory - 18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings. Lecture Notes in Computer Science 8633, Springer 2014, ISBN 978-3-319-09697-1
Finite Automata and Regular Languages
- Dmitry Berdinsky, Bakhadyr Khoussainov:
On Automatic Transitive Graphs. 1-12 - Janusz A. Brzozowski, Marek Szykula
:
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals. 13-24 - Sven De Felice, Cyril Nicaud:
On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States. 25-36 - Yo-Sub Han, Sang-Ki Ko
State Complexity of Deletion. 37-48 - Jorge Almeida, Emanuele Rodaro:
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. 49-60 - Mikhail V. Berlinkov
On Two Algorithmic Problems about Synchronizing Automata - (Short Paper). 61-67 - Vladimir V. Gusev
Synchronizing Automata with Random Inputs - (Short Paper). 68-75 - Ryoma Sin'ya
Graph Spectral Properties of Deterministic Finite Automata - (Short Paper). 76-83
Pushdown Automata and Related Models
- Alexander Okhotin
Input-Driven Pushdown Automata with Limited Nondeterminism - (Invited Paper). 84-102 - Joost Engelfriet, Sebastian Maneth, Helmut Seidl:
How to Remove the Look-Ahead of Top-Down Tree Transducers. 103-115 - Salvatore La Torre, Margherita Napoli, Gennaro Parlato
Scope-Bounded Pushdown Languages. 116-128 - Pierre-Alain Reynier, Jean-Marc Talbot:
Visibly Pushdown Transducers with Well-Nested Outputs. 129-141 - Markus L. Schmid:
Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing. 142-153 - Alexey Sorokin:
Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars. 154-165
Combinatorics and Algorithmics on Words
- Bruno Durand, Guilhem Gamard
Aperiodic Tilings and Entropy. 166-177 - Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka:
k-Abelian Pattern Matching. 178-190 - Juhani Karhumäki, Svetlana Puzynina:
On k-Abelian Palindromic Rich and Poor Words. 191-202 - Juhani Karhumäki, Aleksi Saarela
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence. 203-214 - Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. 215-226 - Bastien Le Gloannec, Nicolas Ollinger:
Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings. 227-238 - David Sprunger, William Tune, Jörg Endrullis
Eigenvalues and Transduction of Morphic Sequences. 239-251 - Victor Marsault, Jacques Sakarovitch:
Breadth-First Serialisation of Trees and Rational Languages - (Short Paper). 252-259
Algebraic, Decidability and Complexity Problems for Languages
- Martin Kutrib
Measuring Communication in Automata Systems - (Invited Paper). 260-274 - Pascal Weil:
From Algebra to Logic: There and Back Again The Story of a Hierarchy - (Invited Paper). 275-278 - Joel D. Day, Daniel Reidenbach, Markus L. Schmid:
Closure Properties of Pattern Languages. 279-290 - Markus Holzer
Minimal and Hyper-Minimal Biautomata - (Extended Abstract). 291-302 - Martin Kutrib
Deterministic Set Automata. 303-314 - Klaus Reinhardt, Abuzer Yakaryilmaz
The Minimum Amount of Useful Space: New Results and New Directions. 315-326 - Abuzer Yakaryilmaz
Debates with Small Transparent Quantum Verifiers. 327-338 - Anne Dicky, David Janin:
Embedding Finite and Infinite Words into Overlapping Tiles - (Short Paper). 339-347
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 19:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: