Multiple Usage of Random Bits in Finite Automata (Q2898066): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Generalisations of disjunctive sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state verifiers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of probabilistic versus deterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amount of nonconstructivity in deterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knowledge complexity of interactive proof-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On?-Languages whose syntactic monoid is trivial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private vs. common random bits in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time quantum computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to the definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Theory of Secrecy Systems* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of one-tape linear-time Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE ROLES OF ADVICE TO ONE-TAPE LINEAR-TIME TURING MACHINES AND FINITE AUTOMATA / rank
 
Normal rank

Latest revision as of 12:07, 5 July 2024

scientific article
Language Label Description Also known as
English
Multiple Usage of Random Bits in Finite Automata
scientific article

    Statements

    Multiple Usage of Random Bits in Finite Automata (English)
    0 references
    16 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references