CIAA 2024: 28TH INTERNATIONAL CONFERENCE ON IMPLEMENTATION AND APPLICATION OF AUTOMATA

A
Asarin, Eugene	Computing the Bandwidth of Meager Timed Automata
B
Barnoff, Aaron	Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
Baumgartner, Robert	PDFA distillation with error bound guarantees
Berglund, Martin	Constructing a BPE Tokenization DFA
Bester, Willem	Benchmarking Regular Expression Matching
Boichut, Yohan	SAT-Based Automated Completion for Reachability Analysis
Boigelot, Bernard	Non-Emptiness Test for Automata over Words Indexed by Reals and Rationals
Boiret, Adrien	SAT-Based Automated Completion for Reachability Analysis
Bright, Curtis	Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
D
Degorre, Aldric	Computing the Bandwidth of Meager Timed Automata
Dieck, Simon	On bidirectional deterministic finite automata
Dima, Catalin	Computing the Bandwidth of Meager Timed Automata
Duarte, Guilherme	Block Languages and their Bitmap Representations
Duret-Lutz, Alexandre	Translation of Semi-Extended Regular Expressions using Derivatives
E
Egri-Nagy, Attila	From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
F
Fontaine, Pascal	Non-Emptiness Test for Automata over Words Indexed by Reals and Rationals
G
Gruber, Hermann	On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
H
Han, Yo-Sub	Benchmarking Regular Expression Matching
Herrmann, Luisa	Global One-Counter Tree Automata
Holzer, Markus	On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
Hospodár, Michal	Decision Problems for Subregular Classes
Hugot, Vincent	SAT-Based Automated Completion for Reachability Analysis
I
Iwami, Munehiro	Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata
J
Jacobo Inclán, Bernardo	Computing the Bandwidth of Meager Timed Automata
Jirasek, Jozef	State Complexity of the Minimal Star Basis
Jiraskova, Galina	State Complexity of the Minimal Star Basis
K
Ko, Sang-Ki	Neuro-Symbolic Approach for Efficient Regular Expression Inference
Kupferman, Orna	Playing Games on Automata
Kutrib, Martin	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
M
Malcher, Andreas	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
Maneth, Sebastian	Attributed Tree Transducers for Partial Functions
Martens, Willeke	Constructing a BPE Tokenization DFA
Martin, Antoine	Translation of Semi-Extended Regular Expressions using Derivatives
Martynova, Olga	Exact descriptional complexity of determinization of input-driven pushdown automata
Mereghetti, Carlo	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
Moreira, Nelma	Block Languages and their Bitmap Representations
Mörbitz, Richard	Global One-Counter Tree Automata
N
Nakano, Keisuke	Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata
Nehaniv, Chrystopher	From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
Nowotka, Dirk	The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
Nyberg-Brodda, Carl-Fredrik	(Semi)group languages
O
Okhotin, Alexander	Decision problems for reversible and permutation automata
Olejár, Viktor	Decision Problems for Subregular Classes
P
Palano, Beatrice	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
Pighizzini, Giovanni	Push Complexity: Optimal Bounds and Unary Inputs
Prigioniero, Luca	Block Languages and their Bitmap Representations
R
Radionova, Maria	Decision problems for reversible and permutation automata
Raucci, Priscilla	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
Rauch, Christian	On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
Reis, Rogério	Block Languages and their Bitmap Representations
Renault, Etienne	Translation of Semi-Extended Regular Expressions using Derivatives
Roodt, Alexander	Benchmarking Regular Expression Matching
S
Seki, Hiroyuki	Automata and Grammars for Data Words
Shallit, Jeffrey	Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals State Complexity of the Minimal Star Basis
Sin'Ya, Ryoma	Measuring Power of Commutative Group Languages
Sung, Sicheol	Benchmarking Regular Expression Matching
T
Tang, Tianxiang	On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers
V
van der Merwe, Brink	Benchmarking Regular Expression Matching Constructing a BPE Tokenization DFA
Vergain, Baptiste	Non-Emptiness Test for Automata over Words Indexed by Reals and Rationals
Verwer, Sicco	PDFA distillation with error bound guarantees On bidirectional deterministic finite automata
Vu, Viet Anh Martin	Attributed Tree Transducers for Partial Functions
W
Watling, Brendan	Benchmarking Regular Expression Matching
Wendlandt, Matthias	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
Wiedenhöft, Max	The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
Y
Yuyama, Takao	Measuring Power of Commutative Group Languages
Z
Zakharov, Vladimir	On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers
Š
Šebej, Juraj	Decision Problems for Subregular Classes

Disclaimer | Powered by EasyChair Smart Program