default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th CIAA 2024: Akita, Japan
- Szilárd Zsolt Fazekas
:
Implementation and Application of Automata - 28th International Conference, CIAA 2024, Akita, Japan, September 3-6, 2024, Proceedings. Lecture Notes in Computer Science 15015, Springer 2024, ISBN 978-3-031-71111-4
Invited Talk
- Hiroyuki Seki:
Automata and Grammars for Data Words. 3-16
Contributed Papers
- Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán:
Computing the Bandwidth of Meager Timed Automata. 19-34 - Aaron Barnoff, Curtis Bright, Jeffrey O. Shallit:
Using Finite Automata to Compute the Base-b Representation of the Golden Ratio and Other Quadratic Irrationals. 35-50 - Robert Baumgartner, Sicco Verwer:
PDFA Distillation with Error Bound Guarantees. 51-65 - Martin Berglund, Willeke Martens, Brink van der Merwe:
Constructing a BPE Tokenization DFA. 66-78 - Yohan Boichut, Vincent Hugot, Adrien Boiret:
SAT-Based Automated Completion for Reachability Analysis. 79-93 - Bernard Boigelot, Pascal Fontaine, Baptiste Vergain:
Non-emptiness Test for Automata over Words Indexed by the Reals and Rationals. 94-108 - Simon Dieck, Sicco Verwer:
On Bidirectional Deterministic Finite Automata. 109-123 - Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis:
Block Languages and Their Bitmap Representations. 124-137 - Attila Egri-Nagy, Chrystopher L. Nehaniv:
From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups. 138-152 - Hermann Gruber, Markus Holzer, Christian Rauch:
On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract). 153-165 - Luisa Herrmann, Richard Mörbitz:
Global One-Counter Tree Automata. 166-179 - Michal Hospodár, Viktor Olejár, Juraj Sebej:
Decision Problems for Subregular Classes. 180-194 - Jozef Jirásek, Galina Jirásková, Jeffrey O. Shallit:
State Complexity of the Minimal Star Basis. 195-207 - Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt:
On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. 208-220 - Sebastian Maneth, Martin Vu:
Attributed Tree Transducers for Partial Functions. 221-233 - Antoine Martin, Etienne Renault, Alexandre Duret-Lutz:
Translation of Semi-extended Regular Expressions Using Derivatives. 234-248 - Olga Martynova:
Exact Descriptional Complexity of Determinization of Input-Driven Pushdown Automata. 249-260 - Keisuke Nakano, Munehiro Iwami:
Disproving Termination of Non-erasing Sole Combinatory Calculus with Tree Automata. 261-275 - Dirk Nowotka, Max Wiedenhöft:
The Equivalence Problem of E-Pattern Languages with Regular Constraints Is Undecidable. 276-288 - Giovanni Pighizzini:
Push Complexity: Optimal Bounds and Unary Inputs. 289-301 - Maria Radionova, Alexander Okhotin:
Decision Problems for Reversible and Permutation Automata. 302-315 - Alexander Roodt, Brendan Keith Mark Watling, Willem Bester, Brink van der Merwe, Sicheol Sung, Yo-Sub Han:
Benchmarking Regular Expression Matching. 316-331 - Tianxiang Tang, Vladimir A. Zakharov:
On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers. 332-346 - Takao Yuyama, Ryoma Sin'ya:
Measuring Power of Commutative Group Languages. 347-362
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-02-05 20:40 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:
