Layered memory automata: recognizers for quasi-regular languages with unbounded memory (Q2165231)

From MaRDI portal
Revision as of 04:41, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Layered memory automata: recognizers for quasi-regular languages with unbounded memory
scientific article

    Statements

    Layered memory automata: recognizers for quasi-regular languages with unbounded memory (English)
    0 references
    0 references
    0 references
    0 references
    19 August 2022
    0 references
    data languages
    0 references
    memory automata
    0 references
    register automata
    0 references
    unbounded memory
    0 references
    quasi-regular languages
    0 references

    Identifiers