:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Staiger, Ludwig
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory 68Q45, F.4
Online Access:	https://arxiv.org/abs/2501.15192
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A note on Automatic Baire property
by: Staiger, Ludwig
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
by: Yordzhev, Krasimir
Published: (2026)

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

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

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

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

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

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

Layered automata: A canonical model for automata over infinite words
by: Casares, Antonio, et al.
Published: (2026)

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

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

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

A hierarchy of reversible finite automata
by: Radionova, Maria, et al.
Published: (2024)

The memory of $ω$-regular and BC($Σ_2^0$) objectives
by: Casares, Antonio, et al.
Published: (2025)

Transition-based vs stated-based acceptance for automata over infinite words
by: Casares, Antonio
Published: (2025)

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

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

A quadratic upper bound on the reset thresholds of synchronizing automata containing a transitive permutation group
by: Zhu, Yinfeng
Published: (2024)

A lower bound on the state complexity of transforming two-way nondeterministic finite automata to unambiguous finite automata
by: Petrov, Semyon, et al.
Published: (2024)

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

On Computational Completeness of Semi-Conditional Matrix Grammars
by: Fernau, Henning, et al.
Published: (2024)

Nondeterministic tree-walking automata are not closed under complementation
by: Martynova, Olga, et al.
Published: (2024)

Mostowski Index via extended register games
by: Idir, Olivier, et al.
Published: (2024)

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