A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products (Q1123627)

From MaRDI portal
Revision as of 17:31, 13 July 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
A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products
scientific article

    Statements

    A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products (English)
    0 references
    0 references
    0 references
    1989
    0 references
    Let \({\mathcal K}\) be a finite class of finite automata of the form \(A=(A,X,\delta)\), \(\delta\) : \(A\times X\to A\). If A is not metrically complete then it is decidable whether A can be homomorphically represented by an \(\alpha_ 0\)-product of automata from \({\mathcal K}\).
    0 references
    deterministic automata
    0 references
    \(\alpha _ 0\)-product of automata
    0 references

    Identifiers