Profinite techniques for probabilistic automata and the Markov monoid algorithm (Q529062): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3365833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidable Problems for Probabilistic Automata on Infinite Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisation of an Algebraic Algorithm for Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the value 1 problem for probabilistic leaktight automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the Value 1 Problem for Probabilistic Leaktight Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Topological Approach to Recognition / 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: Q4595047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profinite Methods in Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages of Profinite Words and the Limitedness Problem / rank
 
Normal rank

Latest revision as of 19:38, 13 July 2024

scientific article
Language Label Description Also known as
English
Profinite techniques for probabilistic automata and the Markov monoid algorithm
scientific article

    Statements

    Identifiers