Introducing Divergence for Infinite Probabilistic Models
Fuente:
arXiv
Saved in:
| Main Authors: | Finkel, Alain, Haddad, Serge, Ye, Lina |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Probabilistic Finite Automaton Emptiness is undecidable
by: Rote, Günter
Published: (2024)
by: Rote, Günter
Published: (2024)
Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
by: Rote, Günter
Published: (2024)
by: Rote, Günter
Published: (2024)
Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
by: Udupa, Sumukha, et al.
Published: (2024)
by: Udupa, Sumukha, et al.
Published: (2024)
Characterizing NC1 with Typed Monoids
by: Dawar, Anuj, et al.
Published: (2025)
by: Dawar, Anuj, et al.
Published: (2025)
Lexicographic transductions of finite words
by: Filiot, Emmanuel, et al.
Published: (2025)
by: Filiot, Emmanuel, et al.
Published: (2025)
Orbit-finite linear programming
by: Ghosh, Arka, et al.
Published: (2023)
by: Ghosh, Arka, et al.
Published: (2023)
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
by: Grabolle, Gustav
Published: (2022)
by: Grabolle, Gustav
Published: (2022)
Non-reducible Modal Transition Systems
by: Basile, Davide
Published: (2023)
by: Basile, Davide
Published: (2023)
Learning real-time one-counter automata using polynomially many queries
by: Mathew, Prince, et al.
Published: (2024)
by: Mathew, Prince, et al.
Published: (2024)
On Repetitive Finite Automata with Translucent Words
by: Mráz, František, et al.
Published: (2025)
by: Mráz, František, et al.
Published: (2025)
On the Boolean Closure of Deterministic Top-Down Tree Automata
by: Löding, Christof, et al.
Published: (2024)
by: Löding, Christof, et al.
Published: (2024)
On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
by: Löding, Christof, et al.
Published: (2022)
by: Löding, Christof, et al.
Published: (2022)
Recognizing Numbers
by: Gaba, Pranshu, et al.
Published: (2025)
by: Gaba, Pranshu, et al.
Published: (2025)
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
by: Bojańczyk, Mikołaj, et al.
Published: (2021)
by: Bojańczyk, Mikołaj, et al.
Published: (2021)
Commuting upper triangular binary morphisms
by: Honkala, Juha
Published: (2023)
by: Honkala, Juha
Published: (2023)
A Robust Measure on FDFAs Following Duo-Normalized Acceptance
by: Fisman, Dana, et al.
Published: (2023)
by: Fisman, Dana, et al.
Published: (2023)
Automata with Timers
by: Bruyère, Véronique, et al.
Published: (2023)
by: Bruyère, Véronique, et al.
Published: (2023)
Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages
by: Hopkins, Mark, et al.
Published: (2023)
by: Hopkins, Mark, et al.
Published: (2023)
Algebraic Language Theory with Effects
by: Lenke, Fabian, et al.
Published: (2024)
by: Lenke, Fabian, et al.
Published: (2024)
Active Learning Techniques for Pomset Recognizers
by: Pommellet, Adrien, et al.
Published: (2025)
by: Pommellet, Adrien, et al.
Published: (2025)
Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
by: Löding, Christof, et al.
Published: (2025)
by: Löding, Christof, et al.
Published: (2025)
Store Languages of Turing Machines and Counter Machines
by: Friesen, Noah, et al.
Published: (2025)
by: Friesen, Noah, et al.
Published: (2025)
Active Learning of Upward-Closed Sets of Words
by: Aristote, Quentin
Published: (2025)
by: Aristote, Quentin
Published: (2025)
Deciding DFA-Primality is NP-Hard
by: Spenner, Daniel Alexander
Published: (2026)
by: Spenner, Daniel Alexander
Published: (2026)
Verifying Unboundedness via Amalgamation
by: Anand, Ashwani, et al.
Published: (2024)
by: Anand, Ashwani, et al.
Published: (2024)
Omega-Regular Robustness
by: Fisman, Dana, et al.
Published: (2025)
by: Fisman, Dana, et al.
Published: (2025)
Runtime Consultants
by: Fisman, Dana, et al.
Published: (2025)
by: Fisman, Dana, et al.
Published: (2025)
Learning Realtime One-Counter Automata
by: Bruyère, Véronique, et al.
Published: (2021)
by: Bruyère, Véronique, et al.
Published: (2021)
On History-Deterministic One-Counter Nets
by: Prakash, Keya, et al.
Published: (2022)
by: Prakash, Keya, et al.
Published: (2022)
Monads, Comonads, and Transducers
by: Stefański, Rafał
Published: (2024)
by: Stefański, Rafał
Published: (2024)
How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
by: Havel, Martin, et al.
Published: (2024)
by: Havel, Martin, et al.
Published: (2024)
A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
by: Doveri, Kyveli, et al.
Published: (2024)
by: Doveri, Kyveli, et al.
Published: (2024)
Identity Testing for Stochastic Languages
by: Agarwal, Smayan, et al.
Published: (2025)
by: Agarwal, Smayan, et al.
Published: (2025)
Openness And Partial Adjacency In One Variable TPTL
by: Krishna, Shankara Narayanan, et al.
Published: (2024)
by: Krishna, Shankara Narayanan, et al.
Published: (2024)
Parsing Hypergraphs using Context-Free Positional Grammars
by: Costagliola, Gennaro, et al.
Published: (2026)
by: Costagliola, Gennaro, et al.
Published: (2026)
Various Types of Comet Languages and their Application in External Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2024)
by: Ködding, Marvin, et al.
Published: (2024)
Exploring Complexity: An Extended Study of Formal Properties for Process Model Complexity Measures
by: Schalk, Patrizia, et al.
Published: (2024)
by: Schalk, Patrizia, et al.
Published: (2024)
Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
by: Silva, Jorge Miguel
Published: (2026)
by: Silva, Jorge Miguel
Published: (2026)
A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
by: Ong, Shawn, et al.
Published: (2025)
by: Ong, Shawn, et al.
Published: (2025)
Stratifiable formulae are not context-free
by: Ryan-Smith, Calliope
Published: (2023)
by: Ryan-Smith, Calliope
Published: (2023)
Similar Items
-
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) -
Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
by: Udupa, Sumukha, et al.
Published: (2024) -
Characterizing NC1 with Typed Monoids
by: Dawar, Anuj, et al.
Published: (2025) -
Lexicographic transductions of finite words
by: Filiot, Emmanuel, et al.
Published: (2025)