Developments in Language Theory C

31 papers

YearTitle / Authors
2014Aperiodic Tilings and Entropy.
Bruno Durand, Guilhem Gamard, Anaël Grandjean
2014Breadth-First Serialisation of Trees and Rational Languages - (Short Paper).
Victor Marsault, Jacques Sakarovitch
2014Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing.
Markus L. Schmid
2014Closure Properties of Pattern Languages.
Joel D. Day, Daniel Reidenbach, Markus L. Schmid
2014Debates with Small Transparent Quantum Verifiers.
Abuzer Yakaryilmaz, A. C. Cem Say, H. Gökalp Demirci
2014Deterministic Set Automata.
Martin Kutrib, Andreas Malcher, Matthias Wendlandt
2014Developments in Language Theory - 18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings
Arseny M. Shur, Mikhail V. Volkov
2014Eigenvalues and Transduction of Morphic Sequences.
David Sprunger, William Tune, Jörg Endrullis, Lawrence S. Moss
2014Embedding Finite and Infinite Words into Overlapping Tiles - (Short Paper).
Anne Dicky, David Janin
2014From Algebra to Logic: There and Back Again The Story of a Hierarchy - (Invited Paper).
Pascal Weil
2014Graph Spectral Properties of Deterministic Finite Automata - (Short Paper).
Ryoma Sin'ya
2014How to Remove the Look-Ahead of Top-Down Tree Transducers.
Joost Engelfriet, Sebastian Maneth, Helmut Seidl
2014Input-Driven Pushdown Automata with Limited Nondeterminism - (Invited Paper).
Alexander Okhotin, Kai Salomaa
2014Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings.
Bastien Le Gloannec, Nicolas Ollinger
2014Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word.
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
2014Measuring Communication in Automata Systems - (Invited Paper).
Martin Kutrib, Andreas Malcher
2014Minimal and Hyper-Minimal Biautomata - (Extended Abstract).
Markus Holzer, Sebastian Jakobi
2014On Automatic Transitive Graphs.
Dmitry Berdinsky, Bakhadyr Khoussainov
2014On Two Algorithmic Problems about Synchronizing Automata - (Short Paper).
Mikhail V. Berlinkov
2014On k-Abelian Palindromic Rich and Poor Words.
Juhani Karhumäki, Svetlana Puzynina
2014On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States.
Sven De Felice, Cyril Nicaud
2014Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars.
Alexey Sorokin
2014Scope-Bounded Pushdown Languages.
Salvatore La Torre, Margherita Napoli, Gennaro Parlato
2014Semisimple Synchronizing Automata and the Wedderburn-Artin Theory.
Jorge Almeida, Emanuele Rodaro
2014State Complexity of Deletion.
Yo-Sub Han, Sang-Ki Ko, Kai Salomaa
2014Synchronizing Automata with Random Inputs - (Short Paper).
Vladimir V. Gusev
2014The Minimum Amount of Useful Space: New Results and New Directions.
Klaus Reinhardt, Abuzer Yakaryilmaz
2014Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals.
Janusz A. Brzozowski, Marek Szykula
2014Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence.
Juhani Karhumäki, Aleksi Saarela, Luca Q. Zamboni
2014Visibly Pushdown Transducers with Well-Nested Outputs.
Pierre-Alain Reynier, Jean-Marc Talbot
2014k-Abelian Pattern Matching.
Thorsten Ehlers, Florin Manea, Robert Mercas, Dirk Nowotka