On Models of a Nondeterministic Computation (Q3392968): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_31 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1709153679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability on quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-Walking Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A communication hierarchy of parallel computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite model theory and its applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating and empty alternating auxiliary stack automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of synchronization in parallel computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Formal Systems. (AM-47) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Models of a Nondeterministic Computation / rank
 
Normal rank

Latest revision as of 21:57, 1 July 2024

scientific article
Language Label Description Also known as
English
On Models of a Nondeterministic Computation
scientific article

    Statements

    On Models of a Nondeterministic Computation (English)
    0 references
    18 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    automaton
    0 references
    nondeterminism
    0 references
    complexity class
    0 references
    0 references
    0 references