default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th DLT 2015: Liverpool, UK
- Igor Potapov:
Developments in Language Theory - 19th International Conference, DLT 2015, Liverpool, UK, July 27-30, 2015, Proceedings. Lecture Notes in Computer Science 9168, Springer 2015, ISBN 978-3-319-21499-3 - Mikolaj Bojanczyk:
Recognisable Languages over Monads. 1-13 - Patrick Dehornoy:
Garside and Quadratic Normalisation: A Survey. 14-45 - Markus Lohrey:
Grammar-Based Tree Compression. 46-57 - Jorge Almeida, Jana Bartonová, Ondrej Klíma, Michal Kunc:
On Decidability of Intermediate Levels of Concatenation Hierarchies. 58-70 - Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Ergodic Infinite Permutations of Minimal Complexity. 71-84 - Hideo Bannai, Travis Gagie
, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto:
Diverse Palindromic Factorization Is NP-complete. 85-96 - Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit:
Factorization in Formal Languages. 97-107 - Dietmar Berwanger, Marie van den Bogaard:
Consensus Game Acceptors. 108-119 - Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác:
On the Size of Two-Way Reasonable Automata for the Liveness Problem. 120-131 - Francine Blanchet-Sadri, Abraham Rashin:
Squareable Words. 132-142 - Christian Brandl, Hans Ulrich Simon:
Complexity Analysis: Transformation Monoids of Finite Automata. 143-154 - Srecko Brlek, Nadia Lafrenière, Xavier Provençal:
Palindromic Complexity of Trees. 155-166 - Marie-Pierre Béal, Pavel Heller:
Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts. 167-178 - Luc Boasson, Olivier Carton:
Transfinite Lyndon Words. 179-190 - James D. Currie, Florin Manea, Dirk Nowotka:
Unary Patterns with Permutations. 191-202 - Christopher Czyba, Christopher Spinrath, Wolfgang Thomas:
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change. 203-214 - Francesco Dolce, Dominique Perrin:
Enumeration Formulæ in Neutral Sets. 215-227 - Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Density of Context-Free and Counter Languages. 228-239 - Zoltán Ésik, Uli Fahrenberg, Axel Legay:
*-Continuous Kleene ω-Algebras. 240-251 - Aida Gainutdinova, Abuzer Yakaryilmaz:
Unary Probabilistic and Quantum Automata on Promise Problems. 252-263 - Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Generalizations of Code Languages with Marginal Errors. 264-275 - Markus Holzer, Sebastian Jakobi, Martin Kutrib:
Minimal Reversible Deterministic Finite Automata. 276-287 - Ismaël Jecker, Emmanuel Filiot:
Multi-sequential Word Relations. 288-299 - Jozef Jirásek, Galina Jirásková:
The Boundary of Prefix-Free Languages. 300-312 - Ines Klimann, Matthieu Picantin, Dmytro Savchuk:
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group. 313-325 - Shiguang Feng, Markus Lohrey, Karin Quaas:
Path Checking for MTL and TPTL over Data Words. 326-339 - Andreas Krebs, Klaus-Jörn Lange, Michael Ludwig:
On Distinguishing NC1 and NL. 340-351 - Victor Marsault:
Surminimisation of Automata. 352-363 - Tomás Masopust, Michaël Thomazo:
On the Complexity of k-Piecewise Testability and the Depth of Automata. 364-376 - Zuzana Masáková, Edita Pelantová, Stepán Starosta:
Interval Exchange Words and the Question of Hof, Knill, and Simon. 377-388 - Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Neighbourhoods and Approximate Pattern Matching. 389-400 - Friedrich Otto, Kent Kwee:
Deterministic Ordered Restarting Automata that Compute Functions. 401-412 - Vitaly Perevoshchikov:
Weight Assignment Logic. 413-425 - Tomoyuki Yamakami:
Complexity Bounds of Constant-Space Quantum Computation - (Extended Abstract). 426-438
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:
