default search action
20th DLT 2016: Montréal, Canada
- Srecko Brlek, Christophe Reutenauer:
Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings. Lecture Notes in Computer Science 9840, Springer 2016, ISBN 978-3-662-53131-0 - Hendrikus J. S. Basten:
Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata. 1-12 - Nicolas Bedon:
Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets. 13-25 - Dmitry Berdinsky:
Cayley Automatic Groups and Numerical Characteristics of Turing Transducers. 26-37 - Devendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade, Ashutosh Trivedi:
A Perfect Class of Context-Sensitive Timed Languages. 38-50 - Sabine Broda
, António Machiavelo
Position Automaton Construction for Regular Expressions with Intersection. 51-63 - Michaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange:
A Language-Theoretical Approach to Descriptive Complexity. 64-76 - Julien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland
k-Abelian Equivalence and Rationality. 77-88 - Liang-Ting Chen
Schützenberger Products in a Category. 89-101 - Da-Jung Cho, Yo-Sub Han, Timothy Ng
Outfix-Guided Insertion - (Extended Abstract). 102-113 - Christian Choffrut, Bruno Guillon
Both Ways Rational Functions. 114-124 - Luc Dartois
Aperiodic String Transducers. 125-137 - Tobias Denkinger:
An Automata Characterisation for Multiple Context-Free Languages. 138-150 - Stefan Dück:
Weighted Automata and Logics on Infinite Graphs. 151-163 - Jörg Endrullis
Degrees of Infinite Words, Polynomials and Atoms. 164-176 - Daniil Gasnikov, Arseny M. Shur:
Ternary Square-Free Partial Words with Many Wildcards. 177-189 - Viliam Geffert:
Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space. 190-202 - Luisa Herrmann, Heiko Vogler:
Weighted Symbolic Automata with Data Storage. 203-215 - Oscar H. Ibarra, Ian McQuillan
On Families of Full Trios Containing Counter Machine Languages. 216-228 - Jozef Jirásek Jr.
Non-regular Maximal Prefix-Free Subsets of Regular Languages. 229-242 - Jozef Jirásek Jr.
Operations on Unambiguous Finite Automata. 243-255 - Dietrich Kuske, Olena Prianychnykova:
The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids. 256-267 - Kent Kwee, Friedrich Otto:
On Ordered RRWW-Automata. 268-279 - Sébastien Labbé
Bispecial Factors in the Brun S-Adic System. 280-292 - Andreas Maletti:
Compositions of Tree-to-Tree Statistical Machine Translation Models. 293-305 - Florin Manea, Dirk Nowotka, Markus L. Schmid:
On the Solvability Problem for Restricted Classes of Word Equations. 306-318 - Henryk Michalewski, Michal Skrzypczak:
Unambiguous Büchi Is Weak. 319-331 - Dirk Nowotka, Aleksi Saarela
One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations. 332-343 - Pascal Ochem, Matthieu Rosenfeld
Avoidability of Formulas with Two Variables. 344-354 - Adrien Boiret, Raphaela Palenta:
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time. 355-367 - Erik Paul:
On Finite and Polynomial Ambiguity of Weighted Tree Automata. 368-379 - Marek Szykula
An Extremal Series of Eulerian Synchronizing Automata. 380-392 - Yuya Uezato
Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata. 393-405
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-17 21:05 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: