Imagen de Portada

Deterministic Suffix-reading Automata

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Keerthan, R, Srivathsan, B, Venkatesh, R, Verma, Sagar
Formato:	Preprint
Publicado:	2025
Materias:	Formal Languages and Automata Theory 68Q45 F.1.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Deterministic Suffix-reading Automata
por: Keerthan, R, et al.
Publicado: (2024)

List of Results on the Černý Conjecture and Reset Thresholds for Synchronizing Automata
por: Volkov, Mikhail V.
Publicado: (2025)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
por: Guillon, Bruno, et al.
Publicado: (2025)

Input-Erasing Two-Way Finite Automata
por: Meduna, Alexander, et al.
Publicado: (2025)

On Transition Constructions for Automata -- A Categorical Perspective
por: Cruchten, Mike
Publicado: (2024)

Hypernode Automata
por: Bartocci, Ezio, et al.
Publicado: (2023)

Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
por: Dörfler, Julian, et al.
Publicado: (2024)

The Algebra of Nondeterministic Finite Automata
por: Gorrieri, Roberto
Publicado: (2023)

Kleene Theorems for Lasso Languages and $ω$-Languages
por: Cruchten, Mike
Publicado: (2024)

Computing the Bandwidth of Meager Timed Automata
por: Asarin, Eugene, et al.
Publicado: (2024)

Classically Time-Controlled Quantum Automata: Definition and Properties
por: Díaz-Caro, Alejandro, et al.
Publicado: (2018)

Hexagonal Picture Scanning Automata
por: D, Deepalakshmi, et al.
Publicado: (2025)

A generalization of Deterministic Finite Automata related to discharging
por: Campbell, John M.
Publicado: (2025)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
por: Deng, Zhibo, et al.
Publicado: (2025)

Learning Automata with Name Allocation
por: Frank, Florian, et al.
Publicado: (2025)

Decomposition of Automata recognizing Ideals
por: Berry, Mathias, et al.
Publicado: (2026)

Axiomatizing NFAs Generated by Regular Grammars
por: Gorrieri, Roberto
Publicado: (2024)

Jump Complexity of Deterministic Finite Automata with Translucent Letters
por: Fazekas, Szilárd Zsolt, et al.
Publicado: (2025)

Alternating Nominal Automata with Name Allocation
por: Frank, Florian, et al.
Publicado: (2024)

Nominal Tree Automata With Name Allocation
por: Prucker, Simon, et al.
Publicado: (2024)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
por: Mathew, Prince, et al.
Publicado: (2024)

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
por: Diekert, Volker, et al.
Publicado: (2019)

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
por: Laumen, Jasper, et al.
Publicado: (2026)

Bandwidth of Nondeterministic Finite Automata
por: Cho, Da-Jung, et al.
Publicado: (2026)

Weighing Obese Timed Languages
por: Asarin, Eugene, et al.
Publicado: (2025)

Addition Automata and Attractors of Digit Systems Corresponding to Expanding Rational Matrices
por: Cruz, Anjelo Gabriel R., et al.
Publicado: (2025)

A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
por: Cho, Da-Jung, et al.
Publicado: (2025)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
por: Adsul, Bharat, et al.
Publicado: (2024)

A polynomial-time algorithm for the automatic Baire property
por: Staiger, Ludwig
Publicado: (2025)

A note on Automatic Baire property
por: Staiger, Ludwig
Publicado: (2025)

On Languages Describing Large Graph Classes
por: Fernau, Henning, et al.
Publicado: (2026)

Evolution-Based Timed Opacity under a Universal Observation Model
por: Zhang, Zhe, et al.
Publicado: (2026)

On the Boolean Closure of Deterministic Top-Down Tree Automata
por: Löding, Christof, et al.
Publicado: (2024)

On Constructing Finite Automata by Relational Programming
por: Egri-Nagy, Attila, et al.
Publicado: (2025)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
por: Esparza, Javier, et al.
Publicado: (2025)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
por: Löding, Christof, et al.
Publicado: (2022)

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
por: Scoones, Andrew, et al.
Publicado: (2024)

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
por: Heemstra, Jan, et al.
Publicado: (2025)

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
por: Hendel, Russell Jay
Publicado: (2025)

From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{Θ(1)}}$ states are necessary and sufficient
por: Martynova, Olga, et al.
Publicado: (2025)