Nondeterminism versus determinism of finite automata over directed acyclic graphs (Q1326955)

From MaRDI portal
Revision as of 03:56, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Nondeterminism versus determinism of finite automata over directed acyclic graphs
scientific article

    Statements

    Nondeterminism versus determinism of finite automata over directed acyclic graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 June 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    labelled finite graphs
    0 references
    recognizability of graph languages
    0 references
    automata on acyclic graphs
    0 references
    non-deterministic graph automata
    0 references
    deterministic graph automata
    0 references
    finite-state graph automata
    0 references
    directed acyclic graphs
    0 references