DLT C

33 papers

YearTitle / Authors
2016A Language-Theoretical Approach to Descriptive Complexity.
Michaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange
2016A Perfect Class of Context-Sensitive Timed Languages.
Devendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade, Ashutosh Trivedi
2016Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space.
Viliam Geffert
2016An Automata Characterisation for Multiple Context-Free Languages.
Tobias Denkinger
2016An Extremal Series of Eulerian Synchronizing Automata.
Marek Szykula, Vojtech Vorel
2016Aperiodic String Transducers.
Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier
2016Avoidability of Formulas with Two Variables.
Pascal Ochem, Matthieu Rosenfeld
2016Bispecial Factors in the Brun S-Adic System.
Sébastien Labbé, Julien Leroy
2016Both Ways Rational Functions.
Christian Choffrut, Bruno Guillon
2016Cayley Automatic Groups and Numerical Characteristics of Turing Transducers.
Dmitry Berdinsky
2016Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets.
Nicolas Bedon
2016Compositions of Tree-to-Tree Statistical Machine Translation Models.
Andreas Maletti
2016Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata.
Hendrikus J. S. Basten
2016Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time.
Adrien Boiret, Raphaela Palenta
2016Degrees of Infinite Words, Polynomials and Atoms.
Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela
2016Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings
Srecko Brlek, Christophe Reutenauer
2016Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata.
Yuya Uezato, Yasuhiko Minamide
2016Non-regular Maximal Prefix-Free Subsets of Regular Languages.
Jozef Jirásek Jr.
2016On Families of Full Trios Containing Counter Machine Languages.
Oscar H. Ibarra, Ian McQuillan
2016On Finite and Polynomial Ambiguity of Weighted Tree Automata.
Erik Paul
2016On Ordered RRWW-Automata.
Kent Kwee, Friedrich Otto
2016On the Solvability Problem for Restricted Classes of Word Equations.
Florin Manea, Dirk Nowotka, Markus L. Schmid
2016One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations.
Dirk Nowotka, Aleksi Saarela
2016Operations on Unambiguous Finite Automata.
Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej
2016Outfix-Guided Insertion - (Extended Abstract).
Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa
2016Position Automaton Construction for Regular Expressions with Intersection.
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis
2016Schützenberger Products in a Category.
Liang-Ting Chen, Henning Urbat
2016Ternary Square-Free Partial Words with Many Wildcards.
Daniil Gasnikov, Arseny M. Shur
2016The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids.
Dietrich Kuske, Olena Prianychnykova
2016Unambiguous Büchi Is Weak.
Henryk Michalewski, Michal Skrzypczak
2016Weighted Automata and Logics on Infinite Graphs.
Stefan Dück
2016Weighted Symbolic Automata with Data Storage.
Luisa Herrmann, Heiko Vogler
2016k-Abelian Equivalence and Rationality.
Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland