default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID22nd DLT 2018: Tokyo, Japan
- Mizuho Hoshi, Shinnosuke Seki:
Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings. Lecture Notes in Computer Science 11088, Springer 2018, ISBN 978-3-319-98653-1 - Raffaele Giancarlo, Giovanni Manzini
, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
Block Sorting-Based Transformations on Words: Beyond the Magic BWT. 1-17 - Tomohiro I:
The Runs Theorem and Beyond. 18-23 - Bakhadyr Khoussainov:
A Brief Excursion to Parity Games. 24-35 - Alexander Okhotin:
A Tale of Conjunctive Grammars. 36-59 - Dominique Perrin:
Groups, Languages and Dendric Shifts. 60-73 - Andrew Winslow:
Some Open Problems in Polyomino Tilings. 74-82 - Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez:
Weak Cost Register Automata Are Still Powerful. 83-95 - Nicolas Baudru, Pierre-Alain Reynier:
From Two-Way Transducers to Regular Function Expressions. 96-108 - Simon Beier, Markus Holzer:
Decidability of Right One-Way Jumping Finite Automata. 109-120 - Jason P. Bell, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Additive Number Theory via Approximation by Regular Languages. 121-132 - Johanna Björklund:
Tree-to-Graph Transductions with Scope. 133-144 - Eugenija A. Bondar, Mikhail V. Volkov:
A Characterization of Completely Reachable Automata. 145-155 - Mário J. J. Branco, Jean-Éric Pin:
Inequalities for One-Step Products. 156-168 - Arturo Carpi, Flavio D'Alessandro:
On the Commutative Equivalence of Context-Free Languages. 169-181 - Olivier Carton, Maurice Pouzet:
Simon's Theorem for Scattered Words. 182-193 - Costanza Catalano, Raphaël M. Jungers:
The Synchronizing Probability Function for Primitive Sets of Matrices. 194-205 - Didier Caucal, Chloé Rispal:
Recognizability for Automata. 206-218 - Da-Jung Cho, Yo-Sub Han, Hwee Kim, Kai Salomaa:
Site-Directed Deletion. 219-230 - Charles J. Colbourn, Ryan E. Dougherty, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Counting Subwords and Regular Languages. 231-242 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Deque Languages, Automata and Planar Graphs. 243-255 - Sylvie Davies:
A General Approach to State Complexity of Operations: Formalization and Limitations. 256-268 - Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka, Markus L. Schmid:
On Matching Generalised Repetitive Patterns. 269-281 - Mateus de Oliveira Oliveira, Michael Wehar:
Intersection Non-emptiness and Hardness Within Polynomial Time. 282-290 - Sebastian Eberhard, Gabriel Ebner, Stefan Hetzl:
Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars. 291-303 - Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin:
A Pattern Logic for Automata with Outputs. 304-317 - Lukas Fleischer:
The Intersection Problem for Finite Semigroups. 318-329 - François Gonze, Raphaël M. Jungers:
On Completely Reachable Automata and Subset Reachability. 330-341 - Hermann Gruber, Markus Holzer, Simon Wolfsteiner:
On Minimal Grammar Problems for Finite Languages. 342-353 - Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero:
Reversible Pushdown Transducers. 354-365 - Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. 366-378 - Vladimir V. Gusev, Raphaël M. Jungers, Daniel Prusa:
Dynamics of the Independence Number and Automata Synchronization. 379-391 - Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Closest Substring Problems for Regular Languages. 392-403 - Markus Holzer, Sebastian Jakobi, Jozef Jirásek Jr.:
Computational Complexity of Decision Problems on Self-verifying Finite Automata. 404-415 - Oscar H. Ibarra, Ian McQuillan:
Generalizations of Checking Stack Automata: Characterizations and Hierarchies. 416-428 - Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar:
On Counting Functions of Languages. 429-440 - Galina Jirásková, Alexander Okhotin:
Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata. 441-452 - Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland:
On Abelian Subshifts. 453-464 - Sang-Ki Ko, Reino Niskanen, Igor Potapov:
Reachability Problems in Nondeterministic Polynomial Maps on the Integers. 465-477 - Patrick Landwehr, Christof Löding:
Projection for Büchi Tree Automata with Constraints Between Siblings. 478-490 - Bruno Loff, Nelma Moreira, Rogério Reis:
The Computational Power of Parsing Expression Grammars. 491-502 - Christof Löding, Anton Pirogov:
On Finitely Ambiguous Büchi Automata. 503-515 - Vincent Michielini:
Uniformization Problem for Variants of First Order Logic over Finite Words. 516-528 - Friedrich Otto:
On Deterministic Ordered Restart-Delete Automata. 529-540 - Alexander Rabinovich:
Complementation of Finitely Ambiguous Büchi Automata. 541-552 - Alexander A. Rubtsov:
A Structural Lemma for Deterministic Context-Free Languages. 553-565
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 2026-07-17 01:03 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
