Image de couverture de livre

On History-Deterministic One-Counter Nets

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Prakash, Keya, Thejaswini, K. S.
Format:	Preprint
Publié:	2022
Sujets:	Formal Languages and Automata Theory F.4.3
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Learning Realtime One-Counter Automata
par: Bruyère, Véronique, et autres
Publié: (2021)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
par: Löding, Christof, et autres
Publié: (2025)

Store Languages of Turing Machines and Counter Machines
par: Friesen, Noah, et autres
Publié: (2025)

History-Deterministic Büchi Automata are Succinct
par: Casares, Antonio, et autres
Publié: (2026)

Learning Deterministic One-Counter Automata in Polynomial Time
par: Mathew, Prince, et autres
Publié: (2025)

Algebraic Language Theory with Effects
par: Lenke, Fabian, et autres
Publié: (2024)

Commuting upper triangular binary morphisms
par: Honkala, Juha
Publié: (2023)

Active Learning Techniques for Pomset Recognizers
par: Pommellet, Adrien, et autres
Publié: (2025)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
par: Fisman, Dana, et autres
Publié: (2023)

Active Learning of Upward-Closed Sets of Words
par: Aristote, Quentin
Publié: (2025)

Deciding DFA-Primality is NP-Hard
par: Spenner, Daniel Alexander
Publié: (2026)

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
par: Udupa, Sumukha, et autres
Publié: (2024)

Verifying Unboundedness via Amalgamation
par: Anand, Ashwani, et autres
Publié: (2024)

Omega-Regular Robustness
par: Fisman, Dana, et autres
Publié: (2025)

Runtime Consultants
par: Fisman, Dana, et autres
Publié: (2025)

Monads, Comonads, and Transducers
par: Stefański, Rafał
Publié: (2024)

Automata with Timers
par: Bruyère, Véronique, et autres
Publié: (2023)

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
par: Havel, Martin, et autres
Publié: (2024)

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
par: Doveri, Kyveli, et autres
Publié: (2024)

Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages
par: Hopkins, Mark, et autres
Publié: (2023)

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

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

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
par: Pighizzini, Giovanni
Publié: (2026)

Parsing Hypergraphs using Context-Free Positional Grammars
par: Costagliola, Gennaro, et autres
Publié: (2026)

Various Types of Comet Languages and their Application in External Contextual Grammars
par: Ködding, Marvin, et autres
Publié: (2024)

Introducing Divergence for Infinite Probabilistic Models
par: Finkel, Alain, et autres
Publié: (2023)

The single-use restriction for register automata and transducers over infinite alphabets
par: Stefański, Rafał
Publié: (2024)

A Word Sampler for Well-Typed Functions
par: Considine, Breandan
Publié: (2025)

Non-reducible Modal Transition Systems
par: Basile, Davide
Publié: (2023)

Learning real-time one-counter automata using polynomially many queries
par: Mathew, Prince, et autres
Publié: (2024)

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

Formal Modeling and Verification of Grover's Algorithm
par: Sun, H., et autres
Publié: (2026)

Some Remarks on Marginal Code Languages
par: Konstantinidis, Stavros
Publié: (2026)

On Repetitive Finite Automata with Translucent Words
par: Mráz, František, et autres
Publié: (2025)

Recognizing Numbers
par: Gaba, Pranshu, et autres
Publié: (2025)

Lexicographic transductions of finite words
par: Filiot, Emmanuel, et autres
Publié: (2025)

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

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
par: Bojańczyk, Mikołaj, et autres
Publié: (2021)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
par: Rote, Günter
Publié: (2024)

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
par: Silva, Jorge Miguel
Publié: (2026)