Image de couverture de livre

Hypernode Automata

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bartocci, Ezio, Henzinger, Thomas A., Nickovic, Dejan, da Costa, Ana Oliveira
Format:	Preprint
Publié:	2023
Sujets:	Formal Languages and Automata Theory 68Q45 F.4.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

Learning Automata with Name Allocation
par: Frank, Florian, 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)

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

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

Information-flow Interfaces and Security Lattices
par: Bartocci, Ezio, et autres
Publié: (2024)

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)

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

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

A polynomial-time algorithm for the automatic Baire property
par: Staiger, Ludwig
Publié: (2025)

On Languages Describing Large Graph Classes
par: Fernau, Henning, et autres
Publié: (2026)

A note on Automatic Baire property
par: Staiger, Ludwig
Publié: (2025)

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

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

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

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

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

Kleene Theorems for Lasso Languages and $ω$-Languages
par: Cruchten, Mike
Publié: (2024)

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

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

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

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

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

An $L^{\#}$ Based Algorithm for Active Learning of Minimal Separating Automata
par: Laumen, Jasper, et autres
Publié: (2026)

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
par: Casares, Antonio, et autres
Publié: (2023)

Bandwidth of Nondeterministic Finite Automata
par: Cho, Da-Jung, et autres
Publié: (2026)

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

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

A Logic For Fresh Labelled Transition Systems
par: Bandukara, Mohamed H, et autres
Publié: (2025)

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

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

A generalization of Deterministic Finite Automata related to discharging
par: Campbell, John M.
Publié: (2025)

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

Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
par: Dörfler, Julian, et autres
Publié: (2024)

Flavors of Quantifiers in Hyperlogics
par: Chalupa, Marek, et autres
Publié: (2025)

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

Disproving Termination of Non-Erasing Sole Combinatory Calculus with Tree Automata (Full Version)
par: Nakano, Keisuke, et autres
Publié: (2024)