Finite state machines for strings over infinite alphabets (Q5277703)

From MaRDI portal
Revision as of 01:05, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6743947
Language Label Description Also known as
English
Finite state machines for strings over infinite alphabets
scientific article; zbMATH DE number 6743947

    Statements

    Finite state machines for strings over infinite alphabets (English)
    0 references
    0 references
    0 references
    0 references
    12 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    automata
    0 references
    XML
    0 references
    expressiveness
    0 references
    first-order logic
    0 references
    infinite alphabets
    0 references
    monadic second-order logic
    0 references
    pebbles
    0 references
    registers
    0 references
    0 references