Cover Image

Mata, a Fast and Simple Finite Automata Library (Technical Report)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chocholatý, David, Fiedor, Tomáš, Havlena, Vojtěch, Holík, Lukáš, Hruška, Martin, Lengál, Ondřej, Síč, Juraj
Format:	Preprint
Published:	2023
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

String Solving with Stabilization and Transducers (Technical Report)
by: Chocholatý, David, et al.
Published: (2026)

Negated String Containment is Decidable (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2025)

Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2022)

Complementation of Emerson-Lei Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2024)

On Complementation of Nondeterministic Finite Automata without Full Determinization (Technical Report)
by: Holík, Lukáš, et al.
Published: (2025)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2025)

Kofola 1.0: A Modular Approach to ω-Regular Complementation and Inclusion Checking (Technical Report)
by: Alexaj, Ondrej, et al.
Published: (2026)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)

Parameterized Verification of Quantum Circuits (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2025)

Automata Size Reduction by Procedure Finding
by: Šedý, Michal, et al.
Published: (2024)

A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
by: Tsai, Wei-Lun, et al.
Published: (2026)

Automata Learning with an Incomplete but Inductive Teacher (Technical Report)
by: Stan, Daniel, et al.
Published: (2026)

Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)

Repetitive Finite Automata With Translucent Letters
by: Mráz, František, et al.
Published: (2024)

Descriptional Complexity of Finite Automata -- Selected Highlights
by: Salomaa, Arto, et al.
Published: (2023)

Measure Many Quantum Finite Automata on Infinite Words
by: Midya, Abhisek, et al.
Published: (2026)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
by: Lacroce, Clara, et al.
Published: (2023)

AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2024)

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
by: Kostolányi, Peter, et al.
Published: (2026)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)

Generalised Arc Consistency via the Synchronised Product of Finite Automata wrt a Constraint
by: Beldiceanu, Nicolas
Published: (2025)

Complexity of Unary Exclusive Nondeterministic Finite Automata
by: Kutrib, Martin, et al.
Published: (2024)

Fast and General Automatic Differentiation for Finite-State Methods
by: Yang, Lucas Ondel, et al.
Published: (2026)

Mathematical Approach in Automata and Automata Association
by: Maciel, Sergio Henrique
Published: (2020)

Completely Reachable Almost Group Automata
by: Torres, David Fernando Casas
Published: (2024)

Inference of Deterministic Finite Automata via Q-Learning
by: Hosseinkhani, Elaheh, et al.
Published: (2025)

History-deterministic Parikh Automata
by: Erlich, Enzo, et al.
Published: (2022)

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
by: De Rosa, Mattia, et al.
Published: (2025)

Input-Driven Pushdown Automata with Translucent Input Letters
by: Kutrib, Martin, et al.
Published: (2025)

Cost Automata, Safe Schemes, and Downward Closures
by: Barozzini, David, et al.
Published: (2020)

On Shuffling and Splitting Automata
by: Cunningham, Ignacio Mollo
Published: (2024)

Explorable Parity Automata
by: Hazard, Emile, et al.
Published: (2024)

Automata on Graph Alphabets
by: Bazille, Hugo, et al.
Published: (2026)

Quantitative Language Automata
by: Henzinger, Thomas A., et al.
Published: (2025)

Asynchronism in Cellular Automata
by: Gautam, Virendra Kumar
Published: (2025)

Finite Automata Encoding Piecewise Polynomials
by: Berdinsky, Dmitry, et al.
Published: (2021)

On the Simulation Cost of Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
by: Mazowiecki, Filip, et al.
Published: (2025)

Localising Stochasticity in Weighted Automata
by: Agarwal, Smayan, et al.
Published: (2026)

Saturation Problems for Families of Automata
by: Bohn, León, et al.
Published: (2025)