Critical classes for the \(\alpha _ 0\)-product (Q908704): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q265801
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Zoltán Ésik / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(88)90104-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037608487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5570933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete classes of automata for the \(\alpha _ 0\)-product / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a representation of tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590815 / rank
 
Normal rank

Latest revision as of 12:19, 20 June 2024

scientific article
Language Label Description Also known as
English
Critical classes for the \(\alpha _ 0\)-product
scientific article

    Statements

    Critical classes for the \(\alpha _ 0\)-product (English)
    0 references
    0 references
    0 references
    1988
    0 references
    A class \({\mathcal K}\) of automata is precomplete if it satisfies: (i) there exists an \(A\in {\mathcal K}\) such that the characteristic semigroup of the two-state identity reset automaton is isomorphic to a subsemigroup of the characteristic semigroup S(A) of A; (ii) for every simple group G there is an \(A\in {\mathcal K}\) such that \(G| S(A)\). A class \({\mathcal K}_ 0\) of automata is critical if for every precomplete class \({\mathcal K}\), the inclusion \({\mathcal K}_ 0\subseteq HSP_{\alpha_ 0}({\mathcal K})\) implies that \({\mathcal K}\) is complete for the \(\alpha_ 0\)-product. The paper gives a full description of the critical classes of automata. The notions of weakly precomplete and strongly critical classes are also considered.
    0 references
    0 references
    \(\alpha_ 0\)-product of automata
    0 references
    Krohn-Rhodes decomposition theorem
    0 references
    homomorphic representation
    0 references

    Identifiers