default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th CIAA 2019: Košice, Slovakia
- Michal Hospodár, Galina Jirásková:
Implementation and Application of Automata - 24th International Conference, CIAA 2019, Košice, Slovakia, July 22-25, 2019, Proceedings. Lecture Notes in Computer Science 11601, Springer 2019, ISBN 978-3-030-23678-6
Invited Talks
- Sebastian Maneth:
Static Garbage Collection. 3-9 - Alexander Okhotin
:
Graph-Walking Automata: From Whence They Come, and Whither They are Bound. 10-29
Contributed Papers
- Robert Bakaric, Damir Korencic, Strahil Ristov:
Enumerated Automata Implementation of String Dictionaries. 33-44 - Gilad Baruch, Shmuel T. Klein, Dana Shapira:
New Approaches for Context Sensitive Flash Codes. 45-57 - Anguraj Baskar, R. Ramanujam, S. P. Suresh:
Dolev-Yao Theory with Associative Blindpair Operators. 58-69 - Simon Beier, Markus Holzer:
Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract). 70-82 - Johanna Björklund, Frank Drewes, Giorgio Satta:
Z-Automata for Compact and Direct Representation of Unranked Tree Languages. 83-94 - Angelo Borsotti, Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti:
A Benchmark Production Tool for Regular Expressions. 95-107 - Shuhei Denzumi:
New Algorithms for Manipulating Sequence BDDs. 108-120 - Akio Fujiyoshi, Daniel Prusa:
A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs. 121-132 - Zoltán Fülöp, Andreas Maletti:
Composition Closure of Linear Weighted Extended Top-Down Tree Transducers. 133-145 - Yo-Sub Han, Hwee Kim, Yusei Masuda, Shinnosuke Seki:
A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata. 146-157 - Michal Hospodár:
Descriptional Complexity of Power and Positive Closure on Convex Languages. 158-170 - Stavros Konstantinidis, Mitja Mastnak, Juraj Sebej:
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations. 171-183 - Stavros Konstantinidis, Nelma Moreira, João Pires, Rogério Reis:
Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels. 184-196 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Multi-counter Automata. 197-208 - Frantisek Mráz, Daniel Prusa, Michael Wehar:
Two-Dimensional Pattern Matching Against Basic Picture Languages. 209-221 - Taylor J. Smith, Kai Salomaa:
Decision Problems for Restricted Variants of Two-Dimensional Automata. 222-234 - Yuta Takahashi, Kazuyuki Asada, Keisuke Nakano:
Streaming Ranked-Tree-to-String Transducers. 235-247
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:00 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.
