Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (Q1001895)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
scientific article

    Statements

    Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (English)
    0 references
    0 references
    0 references
    19 February 2009
    0 references
    finite automata
    0 references
    first-order logic
    0 references
    synchronous relations
    0 references
    infinite alphabets
    0 references

    Identifiers