Note on the complexity of Las Vegas automata problems (Q3421911): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964096673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel complexity of finite-state automata problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Las Vegas Automata by Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Las Vegas II: Two-way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence, containment, and covering problems for the regular and context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the space complexity of some decision problems for finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal NFA Problems are Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded reducibility among combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New problems complete for nondeterministic log space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On path equivalence of nondeterministic finite automata / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:51, 25 June 2024

scientific article
Language Label Description Also known as
English
Note on the complexity of Las Vegas automata problems
scientific article

    Statements

    Note on the complexity of Las Vegas automata problems (English)
    0 references
    0 references
    0 references
    8 February 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    Las Vegas finite automata
    0 references
    deterministic and nondeterministic finite automata
    0 references
    computational complexity
    0 references
    0 references