Complementing two-way finite automata (Q2643079): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/iandc/GeffertMP07, #quickstatements; #temporary_batch_1731508824982
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2007.01.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989657066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact lower time bounds for computing Boolean functions on CREW PRAMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting two-way nondeterministic unary automata into simpler automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / 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 power of Las Vegas for one-way communication complexity, OBDDs, and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3517105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementing unary nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / 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: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism and the size of two way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of sweeping automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halting space-bounded computations / 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 note on the reduction of two-way automata to one-way automata / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/iandc/GeffertMP07 / rank
 
Normal rank

Latest revision as of 16:13, 13 November 2024

scientific article
Language Label Description Also known as
English
Complementing two-way finite automata
scientific article

    Statements

    Complementing two-way finite automata (English)
    0 references
    0 references
    0 references
    0 references
    23 August 2007
    0 references
    finite state automata
    0 references
    formal languages
    0 references
    descriptional complexity
    0 references

    Identifiers