Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (Q5089287): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Freeness properties of weighted and probabilistic automata over bounded languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Problems for Probabilistic Finite Automata on Bounded Languages / 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: Q4143209 / 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: Undecidable problems for probabilistic automata of fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / 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: Q4198056 / 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: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / 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: Q3963114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and nearly optimal algorithms for approximating polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / 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: Numerical semigroups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Automata and Stochastic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree of ambiguity of finite automata / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3082263294 / rank
 
Normal rank
Property / title
 
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (English)
Property / title: Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (English) / rank
 
Normal rank

Latest revision as of 09:03, 30 July 2024

scientific article; zbMATH DE number 7559478
Language Label Description Also known as
English
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
scientific article; zbMATH DE number 7559478

    Statements

    0 references
    0 references
    18 July 2022
    0 references
    probabilistic finite automata
    0 references
    cutpoint isolation problem
    0 references
    letter-bounded context-free languages
    0 references
    Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. (English)
    0 references

    Identifiers