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

This page contains an index consisting of author-provided keywords.

A
Active Automata Learning	PDFA distillation with error bound guarantees
Attributed Tree Transducer	Attributed Tree Transducers for Partial Functions
automata	Non-Emptiness Test for Automata over Words Indexed by Reals and Rationals The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable Translation of Semi-Extended Regular Expressions using Derivatives Playing Games on Automata (Semi)group languages
automata construction	Constructing a BPE Tokenization DFA
Automated approximation search	SAT-Based Automated Completion for Reachability Analysis
B
Bandwidth	Computing the Bandwidth of Meager Timed Automata
Block languages	Block Languages and their Bitmap Representations
byte pair encoding	Constructing a BPE Tokenization DFA
C
cascade product	From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
Closure properties	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
Combinatory calculus	Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata
commutative group	Measuring Power of Commutative Group Languages
complexity	On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers
Complexity measures	Push Complexity: Optimal Bounds and Unary Inputs
Computational capacity	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
computational complexity	Decision Problems for Subregular Classes Decision problems for reversible and permutation automata On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
Context-free languages	On bidirectional deterministic finite automata
D
decision problem	On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers
Decision problems	Decision Problems for Subregular Classes
density	Measuring Power of Commutative Group Languages
derivative	Translation of Semi-Extended Regular Expressions using Derivatives
Deterministic Finite Automata	Block Languages and their Bitmap Representations
Deterministic pushdown automata	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
determinization	Exact descriptional complexity of determinization of input-driven pushdown automata
DFA	On bidirectional deterministic finite automata
discrete finite automata	Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
E
emptiness problem	Decision problems for reversible and permutation automata
Emptiness Test	Non-Emptiness Test for Automata over Words Indexed by Reals and Rationals
Entropy	Computing the Bandwidth of Meager Timed Automata
Equivalence	The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
equivalence problem	Decision problems for reversible and permutation automata
Explainable AI	PDFA distillation with error bound guarantees
Exponential Time Hypothesis	On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
F
finite automata	On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract) Constructing a BPE Tokenization DFA
Finite languages	Block Languages and their Bitmap Representations
finite state transducer	On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers
first-order logic with data equality	Automata and Grammars for Data Words
fixed alphabet	Exact descriptional complexity of determinization of input-driven pushdown automata
Functionality	Attributed Tree Transducers for Partial Functions
G
games	Playing Games on Automata
global counter	Global One-Counter Tree Automata
group language	Measuring Power of Commutative Group Languages
H
hierarchical decomposition	From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
I
inapproximability	On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
Inclusion	The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
inference	Neuro-Symbolic Approach for Efficient Regular Expression Inference
infinite words	Playing Games on Automata
Information	Computing the Bandwidth of Meager Timed Automata
input-driven pushdown automata	Exact descriptional complexity of determinization of input-driven pushdown automata
L
Linear languages	On bidirectional deterministic finite automata
Linear Orderings	Non-Emptiness Test for Automata over Words Indexed by Reals and Rationals
LTL with freeze quantifier	Automata and Grammars for Data Words
M
measurability	Measuring Power of Commutative Group Languages
Membership	The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
memoisation	Benchmarking Regular Expression Matching
Minimal Automata	Block Languages and their Bitmap Representations
minimal star basis	State Complexity of the Minimal Star Basis
monoid automata	(Semi)group languages
multiple-entry automata	Decision problems for reversible and permutation automata
N
natural language processing	Constructing a BPE Tokenization DFA
neural networks	Neuro-Symbolic Approach for Efficient Regular Expression Inference
nominal automaton	Automata and Grammars for Data Words
Non-termination	Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata
Nondeterministic Finite Automata	Block Languages and their Bitmap Representations
O
one-counter automata	Global One-Counter Tree Automata
P
parameterized model	On the Complexity of Decision Problems for Parameterized Finite State Synchronous Transducers
Pattern Languages	The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
Patterns	The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
PDFA distillation	PDFA distillation with error bound guarantees
permutation automata	Decision problems for reversible and permutation automata
PSL	Translation of Semi-Extended Regular Expressions using Derivatives
pumping lemmata	On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
pumping preserving homomorphism	On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
pumping property	On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
Pushdown automata	Push Complexity: Optimal Bounds and Unary Inputs
Q
quadratic irrational	Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
R
Rational Domain	Non-Emptiness Test for Automata over Words Indexed by Reals and Rationals
Reachability	Non-Emptiness Test for Automata over Words Indexed by Reals and Rationals
Reachability analysis	SAT-Based Automated Completion for Reachability Analysis
Real Domain	Non-Emptiness Test for Automata over Words Indexed by Reals and Rationals
register automaton	Automata and Grammars for Data Words
register context-free grammar	Automata and Grammars for Data Words
Regular Constraints	The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
regular expression	Translation of Semi-Extended Regular Expressions using Derivatives
regular expressions	Neuro-Symbolic Approach for Efficient Regular Expression Inference
regular language	Measuring Power of Commutative Group Languages
regular languages	State Complexity of the Minimal Star Basis On bidirectional deterministic finite automata
relational morphism	From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
Returning and non-returning computations	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
reversible automata	Decision problems for reversible and permutation automata
S
SAT solver	Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata
SAT solvers (applications of)	SAT-Based Automated Completion for Reachability Analysis
satisfiability solving	Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
semigroups	(Semi)group languages
Spencer regular expression matchers	Benchmarking Regular Expression Matching
star-height preserving homomorphism	On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)
state complexity	Block Languages and their Bitmap Representations State Complexity of the Minimal Star Basis Exact descriptional complexity of determinization of input-driven pushdown automata
Subregular classes	Decision Problems for Subregular Classes
SVA	Translation of Semi-Extended Regular Expressions using Derivatives
sweeping automata	Decision problems for reversible and permutation automata
T
Term rewriting systems	SAT-Based Automated Completion for Reachability Analysis
Thompson and Glushkov constructions	Benchmarking Regular Expression Matching
Timed automata	Computing the Bandwidth of Meager Timed Automata
tokenization	Constructing a BPE Tokenization DFA
transformation semigroup	From Relation to Emulation and Interpretation: Computer Algebra Implementation of the Covering Lemma for Finite Transformation Semigroups
Translucent input letters	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters
Tree automata	Global One-Counter Tree Automata Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata SAT-Based Automated Completion for Reachability Analysis
two-way automata	Decision problems for reversible and permutation automata
U
Unary languages	Push Complexity: Optimal Bounds and Unary Inputs
Undecidability	The Equivalence Problem of E-Pattern Languages with Regular Constraints is Undecidable
Uniformizer	Attributed Tree Transducers for Partial Functions
universality problem	Decision problems for reversible and permutation automata
V
virtual machine	Benchmarking Regular Expression Matching
visibly pushdown automata	Exact descriptional complexity of determinization of input-driven pushdown automata

Disclaimer | Powered by EasyChair Smart Program