DLT C

29 papers

YearTitle / Authors
2017A Characterization of Infinite LSP Words.
Gwénaël Richomme
2017A Comprehensive Introduction to the Theory of Word-Representable Graphs.
Sergey Kitaev
2017A Medvedev Characterization of Recognizable Tree Series.
Luisa Herrmann
2017Binomial Coefficients, Valuations, and Words.
Eric Rowland
2017Classifying Non-periodic Sequences by Permutation Transducers.
Hans Zantema, Wieb Bosma
2017Computer Aided Synthesis: A Game-Theoretic Approach.
Véronique Bruyère
2017Connecting Decidability and Complexity for MSO Logic.
Michal Skrzypczak
2017DFAs and PFAs with Long Shortest Synchronizing Word Length.
Michiel de Bondt, Henk Don, Hans Zantema
2017Deleting Deterministic Restarting Automata with Two Windows.
Frantisek Mráz, Friedrich Otto
2017Developments in Language Theory - 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings
Émilie Charlier, Julien Leroy, Michel Rigo
2017Differences Between 2D Neighborhoods According to Real Time Computation.
Anaël Grandjean
2017Equivalence of Symbolic Tree Transducers.
Vincent Hugot, Adrien Boiret, Joachim Niehren
2017Limited Automata and Unary Languages.
Giovanni Pighizzini, Luca Prigioniero
2017On Computational Complexity of Set Automata.
Alexander A. Rubtsov, Mikhail N. Vyalyi
2017On Regular Expression Proof Complexity.
Simon Beier, Markus Holzer
2017On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$.
Michal Hospodár, Galina Jirásková, Peter Mlynárcik
2017On the Interplay Between Babai and Černý's Conjectures.
François Gonze, Vladimir V. Gusev, Balázs Gerencsér, Raphaël M. Jungers, Mikhail V. Volkov
2017On the Mother of All Automata: The Position Automaton.
Sabine Broda, Markus Holzer, Eva Maia, Nelma Moreira, Rogério Reis
2017On the Number of Rich Words.
Josef Rukavicka
2017On the Power of Permitting Semi-conditional Grammars.
Zsolt Gazdag, Krisztián Tichler
2017On the Tree of Binary Cube-Free Words.
Elena A. Petrova, Arseny M. Shur
2017One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity - (Preliminary Report).
Tomoyuki Yamakami
2017Operational State Complexity and Decidability of Jumping Finite Automata.
Simon Beier, Markus Holzer, Martin Kutrib
2017Relative Prefix Distance Between Languages.
Timothy Ng, David Rappaport, Kai Salomaa
2017The Generalized Rank of Trace Languages.
Michal Kunc, Jan Meitner
2017Two-Variable First Order Logic with Counting Quantifiers: Complexity Results.
Kamal Lodaya, A. V. Sreejith
2017Two-Way Two-Tape Automata.
Olivier Carton, Léo Exibard, Olivier Serre
2017Undecidability and Finite Automata.
Jörg Endrullis, Jeffrey O. Shallit, Tim Smith
2017Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties.
Oscar H. Ibarra, Ian McQuillan