Polynomially ambiguous probabilistic automata on restricted languages (Q2121470): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-error quantum computation with small space bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The boundedness of all products of a pair of matrices is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of computational complexity results in systems and control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / 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: Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143209 / 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: The freeness problem over matrix semigroups and bounded languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Automata and Stochastic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Automata of Bounded Ambiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree of ambiguity of finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Post correspondence problem for letter monotonic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Orbit Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithm for the orbit problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875224 / 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: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogenization and the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093372 / 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: ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equal-subset-sum problem / rank
 
Normal rank

Latest revision as of 14:02, 28 July 2024

scientific article
Language Label Description Also known as
English
Polynomially ambiguous probabilistic automata on restricted languages
scientific article

    Statements

    Polynomially ambiguous probabilistic automata on restricted languages (English)
    0 references
    0 references
    4 April 2022
    0 references
    0 references
    probabilistic finite automata
    0 references
    ambiguity
    0 references
    undecidability
    0 references
    bounded language
    0 references
    formal language theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references