Multiprocessor automata (Q1108012): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3687746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-determinacy in simple computing devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way simple multihead finite automata / rank
 
Normal rank

Latest revision as of 18:46, 18 June 2024

scientific article
Language Label Description Also known as
English
Multiprocessor automata
scientific article

    Statements

    Multiprocessor automata (English)
    0 references
    0 references
    1987
    0 references
    The notion of multiprocessor automata is introduced. The multiprocessor automaton may be thought of as the simplest model of parallel computations: there are more than one processors reading information from the tape simultaneously, and the switching function for each processor depends on the inner states of all processors on the step of computations. We prove some results on the hierarchies of two-way and one-way multiprocessor automata languages.
    0 references
    0 references
    0 references
    0 references
    0 references
    multihead automaton
    0 references
    formal languages hierarchy
    0 references
    multiprocessor automata
    0 references
    model of parallel computations
    0 references
    switching function
    0 references
    0 references