Cover Image

Jump Complexity of Deterministic Finite Automata with Translucent Letters

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fazekas, Szilárd Zsolt, Mitrana, Victor, Păun, Andrei, Păun, Mihaela
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory 68Q45 F.4.3; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalized Parikh Matrices For Tracking Subsequence Occurrences
by: Fazekas, Szilárd Zsolt, et al.
Published: (2024)

Subsequence Matching and Analysis Problems for Formal Languages
by: Fazekas, Szilárd Zsolt, et al.
Published: (2024)

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

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
by: Cojocaru, Liliana
Published: (2015)

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

Decomposition of Automata recognizing Ideals
by: Berry, Mathias, et al.
Published: (2026)

Learning Automata with Name Allocation
by: Frank, Florian, et al.
Published: (2025)

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

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

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

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

Well-Quasi-Orderings on Word Languages
by: Lhote, Nathan, et al.
Published: (2025)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
by: Eickmeyer, Kord, et al.
Published: (2025)

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

Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
by: Alpay, Faruk, et al.
Published: (2026)

The Algebra of Nondeterministic Finite Automata
by: Gorrieri, Roberto
Published: (2023)

The Complexity of Simplifying $ω$-Automata through the Alternating Cycle Decomposition
by: Casares, Antonio, et al.
Published: (2024)

Eve-positional languages: putting order into Büchi automata
by: Idir, Olivier
Published: (2026)

On universality of regular realizability problems
by: Rubtsov, Alexander, et al.
Published: (2023)

Using games and universal trees to characterise the nondeterministic index of tree languages
by: Idir, Olivier, et al.
Published: (2025)

An algebraic characterisation of Eve-positional languages
by: Colcombet, Thomas, et al.
Published: (2026)

Anti-Context-Free languages
by: Cardó, Carles
Published: (2024)

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

New Fault Domains for Conformance Testing of Finite State Machines
by: Vaandrager, Frits, et al.
Published: (2024)

Hamming distance between finite transducers
by: Dartois, Luc, et al.
Published: (2026)

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
by: Casares, Antonio, et al.
Published: (2023)

On Graph Grammars and Games
by: Vijayakumar, Jayakrishna, et al.
Published: (2024)

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

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

Subshifts defined by nondeterministic and alternating plane-walking automata
by: de Menibus, Benjamin Hellouin, et al.
Published: (2024)

Active Automata Learning with Advice
by: Fica, Michał, et al.
Published: (2025)

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

On Repetitive Finite Automata with Translucent Words
by: Mráz, František, et al.
Published: (2025)

Hypernode Automata
by: Bartocci, Ezio, et al.
Published: (2023)

Active Learning of Mealy Machines with Timers
by: Bruyère, Véronique, et al.
Published: (2024)

Well-quasi-ordered classes of bounded clique-width
by: Dumas, Maël, et al.
Published: (2026)

The Word Problem for Finitary Automaton Groups
by: Kotowsky, Maximilian, et al.
Published: (2023)

Systematic Evaluation of Black-Box Checking for Fast Bug Detection
by: Pellen, Bram, et al.
Published: (2025)

Languages of Words of Low Automatic Complexity Are Hard to Compute
by: Chen, Joey, et al.
Published: (2025)

Deterministic Suffix-reading Automata
by: Keerthan, R, et al.
Published: (2025)