Decision Questions for Probabilistic Automata on Small Alphabets (Q6137871): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.46298/lmcs-19(4:36)2023 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.4230/lipics.mfcs.2021.15 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Reachability problems for Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Complexity Bounds for Fragments of the Skolem Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidable problems for probabilistic automata of fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially Ambiguous Probabilistic Automata on Restricted Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust class of linear recurrence sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The presence of a zero in an integer linear recurrent sequence is NP-hard to decide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Questions for Probabilistic Automata on Small Alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel matrix and GCD computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Automata of Bounded Ambiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Automata on Finite Words: Decidable and Undecidable Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete decision problems for binary quadratics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Problems for Linear Recurrence Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positivity Problems for Low-Order Linear Recurrence Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Automata and Stochastic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Occurrence of zero in a linear recursive sequence / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.46298/LMCS-19(4:36)2023 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.MFCS.2021.15 / rank
 
Normal rank

Latest revision as of 18:47, 30 December 2024

scientific article; zbMATH DE number 7789008
Language Label Description Also known as
English
Decision Questions for Probabilistic Automata on Small Alphabets
scientific article; zbMATH DE number 7789008

    Statements

    Decision Questions for Probabilistic Automata on Small Alphabets (English)
    0 references
    0 references
    0 references
    16 January 2024
    0 references
    8 August 2023
    0 references
    probabilistic finite automata
    0 references
    unary alphabet
    0 references
    emptiness problem
    0 references
    bounded ambiguity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references