Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176)

From MaRDI portal
Revision as of 09:13, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7378389
Language Label Description Also known as
English
Polynomial-time equivalence testing for deterministic fresh-register automata
scientific article; zbMATH DE number 7378389

    Statements

    0 references
    0 references
    0 references
    4 August 2021
    0 references
    automata over infinite alphabets
    0 references
    language equivalence
    0 references
    bisimilarity
    0 references
    computational group theory
    0 references
    Polynomial-time equivalence testing for deterministic fresh-register automata (English)
    0 references

    Identifiers