Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities (Q2800414)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities
scientific article

    Statements

    Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities (English)
    0 references
    0 references
    0 references
    0 references
    15 April 2016
    0 references
    distributed computation
    0 references
    systems of finite automata
    0 references
    complexity induced by communication
    0 references

    Identifiers