Cover Image

Learning Deterministic One-Counter Automata in Polynomial Time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mathew, Prince, Penelle, Vincent, Sreejith, A. V.
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory Logic in Computer Science F.3.1; F.4.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning real-time one-counter automata using polynomially many queries
by: Mathew, Prince, et al.
Published: (2024)

Scalable Learning of One-Counter Automata via State-Merging Algorithms
by: Guha, Shibashis, et al.
Published: (2025)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
by: Mathew, Prince, et al.
Published: (2024)

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
by: Geatti, Luca, et al.
Published: (2024)

Learning Realtime One-Counter Automata
by: Bruyère, Véronique, et al.
Published: (2021)

On History-Deterministic One-Counter Nets
by: Prakash, Keya, et al.
Published: (2022)

How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2025)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
by: Basold, Henning, et al.
Published: (2023)

Non-reducible Modal Transition Systems
by: Basile, Davide
Published: (2023)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
by: Löding, Christof, et al.
Published: (2022)

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
by: Pighizzini, Giovanni
Published: (2026)

On the Boolean Closure of Deterministic Top-Down Tree Automata
by: Löding, Christof, et al.
Published: (2024)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
by: Löding, Christof, et al.
Published: (2025)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
by: Grabolle, Gustav
Published: (2022)

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

Characterizing NC1 with Typed Monoids
by: Dawar, Anuj, et al.
Published: (2025)

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
by: Ong, Shawn, et al.
Published: (2025)

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

Automata with Timers
by: Bruyère, Véronique, et al.
Published: (2023)

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
by: Doveri, Kyveli, et al.
Published: (2024)

The complexity of downward closures of indexed languages
by: Mandel, Richard, et al.
Published: (2026)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
by: Bojańczyk, Mikołaj, et al.
Published: (2021)

Store Languages of Turing Machines and Counter Machines
by: Friesen, Noah, et al.
Published: (2025)

Quantitative Assurance and Synthesis of Controllers from Activity Diagrams
by: Ye, Kangfeng, et al.
Published: (2024)

Orbit-finite linear programming
by: Ghosh, Arka, et al.
Published: (2023)

Openness And Partial Adjacency In One Variable TPTL
by: Krishna, Shankara Narayanan, et al.
Published: (2024)

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

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
by: Bobrow, Elliot, et al.
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)

Visualising CTL Witnesses and Counterexamples -- Extended Version
by: Rensink, Arend
Published: (2026)

INTERLEAVE: A Faster Symbolic Algorithm for Maximal End Component Decomposition
by: Bansal, Suguman, et al.
Published: (2025)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
by: Aiswarya, C, et al.
Published: (2024)

Introducing Divergence for Infinite Probabilistic Models
by: Finkel, Alain, et al.
Published: (2023)

Active Learning Techniques for Pomset Recognizers
by: Pommellet, Adrien, et al.
Published: (2025)

Active Learning of Upward-Closed Sets of Words
by: Aristote, Quentin
Published: (2025)

Recognizing Numbers
by: Gaba, Pranshu, et al.
Published: (2025)

Lexicographic transductions of finite words
by: Filiot, Emmanuel, et al.
Published: (2025)

Probabilistic Finite Automaton Emptiness is undecidable
by: Rote, Günter
Published: (2024)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
by: Rote, Günter
Published: (2024)