Cover Image

Finite Automata for Efficient Graph Recognition

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Drewes, Frank, Hoffmann, Berthold, Minas, Mark
Format:	Preprint
Published:	2024
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

Systems of Graph Formulas and their Equivalence to Alternating Graph Automata
by: Drewes, Frank, et al.
Published: (2025)

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

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

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

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)

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

Mata, a Fast and Simple Finite Automata Library (Technical Report)
by: Chocholatý, David, et al.
Published: (2023)

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

Efficient Learning of Weak Deterministic Büchi Automata
by: Alluwayma, Mona, et al.
Published: (2025)

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

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

Fine-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs
by: Drabik, Karolina, et al.
Published: (2025)

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
by: Acharya, Rohan, et al.
Published: (2024)

Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
by: Kiefer, Stefan, et al.
Published: (2019)

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata
by: Fernau, Henning, et al.
Published: (2024)

The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently
by: Lehtinen, Karoliina, et al.
Published: (2025)

A New Notion of Regularity: Finite State Automata Accepting Graphs
by: Meeres, Yvo Ad
Published: (2024)

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

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

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

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

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

Determinism in Multi-Soliton Automata
by: Bordihn, Henning, et al.
Published: (2024)

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

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

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

Nominal Automata with Name Deallocation
by: Prucker, Simon, et al.
Published: (2026)

Simulations for Event-Clock Automata
by: Akshay, S, et al.
Published: (2022)

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)

QuAK: Quantitative Automata Kit
by: Chalupa, Marek, et al.
Published: (2024)

Classifying Words with 3-sort Automata
by: Jastrząb, Tomasz, et al.
Published: (2024)

Query Learning of Advice and Nominal Automata
by: Zhou, Kevin
Published: (2024)

Global One-Counter Tree Automata
by: Herrmann, Luisa, et al.
Published: (2024)

Non-Global Parikh Tree Automata
by: Herrmann, Luisa, et al.
Published: (2024)

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

Universality Frontier for Asynchronous Cellular Automata
by: Baburin, Ivan, et al.
Published: (2025)

History-Deterministic Büchi Automata are Succinct
by: Casares, Antonio, et al.
Published: (2026)