Complexity of probabilistic versus deterministic automata (Q4560366): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4116394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3871943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4141219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3976039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Pushdown and Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some aspects of probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636862 / rank
 
Normal rank

Latest revision as of 16:15, 17 July 2024

scientific article; zbMATH DE number 6992074
Language Label Description Also known as
English
Complexity of probabilistic versus deterministic automata
scientific article; zbMATH DE number 6992074

    Statements

    Complexity of probabilistic versus deterministic automata (English)
    0 references
    0 references
    11 December 2018
    0 references
    0 references
    Turing machine
    0 references
    regular language
    0 references
    finite automaton
    0 references
    memory element
    0 references
    input word
    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
    0 references