default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th DLT 2024: Göttingen, Germany
- Joel D. Day
, Florin Manea:
Developments in Language Theory - 28th International Conference, DLT 2024, Göttingen, Germany, August 12-16, 2024, Proceedings. Lecture Notes in Computer Science 14791, Springer 2024, ISBN 978-3-031-66158-7 - Laura Ciobanu:
Word Equations, Constraints, and Formal Languages. 1-12 - Sandra Kiefer:
Polyregular Functions: Characterisations and Refutations. 13-21 - Martin Kutrib, Andreas Malcher:
Cellular Automata: From Black-and-White to High Gloss Color. 22-36 - C. Aiswarya, Amaldev Manuel, Saina Sunny:
Deciding Conjugacy of a Rational Relation - (Extended Abstract). 37-50 - Amazigh Amrane, Hugo Bazille, Uli Fahrenberg, Marie Fortin:
Logic and Languages of Higher-Dimensional Automata. 51-67 - Ingyu Baek, Joonghyuk Hahn, Yo-Sub Han, Kai Salomaa:
Universal Rewriting Rules for the Parikh Matrix Injectivity Problem. 68-81 - Marco B. Caminati:
O2 is a Multiple Context-Free Grammar: An Implementation-, Formalisation-Friendly Proof. 82-97 - Michele Chiari, Dino Mandrioli, Matteo Pradella:
Cyclic Operator Precedence Grammars for Improved Parallel Parsing. 98-113 - Ferdinando Cicalese, Francesca Ugazio:
On the Complexity and Approximability of Bounded Access Lempel Ziv Coding. 114-130 - Travis Gagie:
How to Find Long Maximal Exact Matches and Ignore Short Ones. 131-140 - Hermann Gruber, Markus Holzer, Christian Rauch:
The Pumping Lemma for Context-Free Languages is Undecidable. 141-155 - Oscar H. Ibarra, Ian McQuillan:
Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors. 156-172 - Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki:
Semidirect Product Decompositions for Periodic Regular Languages. 173-188 - Sungmin Kim, Yo-Sub Han:
Approximate Cartesian Tree Pattern Matching. 189-202 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt:
Deterministic Pushdown Automata with Translucent Input Letters. 203-217 - Philomena Moek:
Network Topologies for Parallel Communicating Finite Automata: Token-Ring and Token-Bus. 218-235 - Benedek Nagy, Friedrich Otto:
Finite Automata with Sets of Translucent Words. 236-251 - Jakub Ruszil:
Careful Synchronization of One-Cluster Automata. 252-265 - Marco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange:
Verifying and Interpreting Neural Networks Using Finite Automata. 266-281 - Yinfeng Zhu:
Around Don's Conjecture for Binary Completely Reachable Automata. 282-295
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 2025-05-23 00:43 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
