Image de couverture de livre

Kleene Theorems for Lasso Languages and $ω$-Languages

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Cruchten, Mike
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory 68Q45 F.4.3; F.1.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Transition Constructions for Automata -- A Categorical Perspective
par: Cruchten, Mike
Publié: (2024)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata
par: Guillon, Bruno, et autres
Publié: (2025)

Input-Erasing Two-Way Finite Automata
par: Meduna, Alexander, et autres
Publié: (2025)

A Formalization of Co-Transcriptional Splicing as an Operation on Formal Languages
par: Cho, Da-Jung, et autres
Publié: (2025)

Weighing Obese Timed Languages
par: Asarin, Eugene, et autres
Publié: (2025)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words
par: Eickmeyer, Kord, et autres
Publié: (2025)

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
par: Diekert, Volker, et autres
Publié: (2019)

Axiomatizing NFAs Generated by Regular Grammars
par: Gorrieri, Roberto
Publié: (2024)

The Algebra of Nondeterministic Finite Automata
par: Gorrieri, Roberto
Publié: (2023)

Computing the Bandwidth of Meager Timed Automata
par: Asarin, Eugene, et autres
Publié: (2024)

Well-Quasi-Orderings on Word Languages
par: Lhote, Nathan, et autres
Publié: (2025)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
par: Esparza, Javier, et autres
Publié: (2025)

Alternating Nominal Automata with Name Allocation
par: Frank, Florian, et autres
Publié: (2024)

Nominal Tree Automata With Name Allocation
par: Prucker, Simon, et autres
Publié: (2024)

Generalized Parikh Matrices For Tracking Subsequence Occurrences
par: Fazekas, Szilárd Zsolt, et autres
Publié: (2024)

Eve-positional languages: putting order into Büchi automata
par: Idir, Olivier
Publié: (2026)

Decomposition of Automata recognizing Ideals
par: Berry, Mathias, et autres
Publié: (2026)

On universality of regular realizability problems
par: Rubtsov, Alexander, et autres
Publié: (2023)

Learning Automata with Name Allocation
par: Frank, Florian, et autres
Publié: (2025)

Using games and universal trees to characterise the nondeterministic index of tree languages
par: Idir, Olivier, et autres
Publié: (2025)

An algebraic characterisation of Eve-positional languages
par: Colcombet, Thomas, et autres
Publié: (2026)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
par: Löding, Christof, et autres
Publié: (2022)

Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages
par: Adsul, Bharat, et autres
Publié: (2024)

Evolution-Based Timed Opacity under a Universal Observation Model
par: Zhang, Zhe, et autres
Publié: (2026)

Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
par: Heemstra, Jan, et autres
Publié: (2025)

The Complexity of Simplifying $ω$-Automata through the Alternating Cycle Decomposition
par: Casares, Antonio, et autres
Publié: (2024)

The memory of $ω$-regular and BC($Σ_2^0$) objectives
par: Casares, Antonio, et autres
Publié: (2025)

Hamming distance between finite transducers
par: Dartois, Luc, et autres
Publié: (2026)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
par: Deng, Zhibo, et autres
Publié: (2025)

$\mathbb{N}$-polyregular functions arise from well-quasi-orderings
par: Lopez, Aliaume
Publié: (2024)

Decision Problems on Copying and Shuffling
par: Halava, Vesa, et autres
Publié: (2023)

Jump Complexity of Deterministic Finite Automata with Translucent Letters
par: Fazekas, Szilárd Zsolt, et autres
Publié: (2025)

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
par: Ong, Shawn, et autres
Publié: (2025)

Deterministic Suffix-reading Automata
par: Keerthan, R, et autres
Publié: (2025)

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

Active Learning of Mealy Machines with Timers
par: Bruyère, Véronique, et autres
Publié: (2024)

Identity Testing for Stochastic Languages
par: Agarwal, Smayan, et autres
Publié: (2025)

Subshifts defined by nondeterministic and alternating plane-walking automata
par: de Menibus, Benjamin Hellouin, et autres
Publié: (2024)

On the Boolean Closure of Deterministic Top-Down Tree Automata
par: Löding, Christof, et autres
Publié: (2024)

Probabilistic Finite Automaton Emptiness is undecidable
par: Rote, Günter
Publié: (2024)