scientific article; zbMATH DE number 4007733
Let \({\mathcal K}\) be a (possibly infinite) class of finite automata (without output symbols) and let \(\beta\) denote some product of automata. We denote by \(HSP_{\beta}({\mathcal K})\) the class of all homomorphic images of subautomata of \(\beta\)-products of automata chosen from the class \({\mathcal K}\). In this paper, \(\beta\) is specified mostly as one of the first three members of the known infinite hierarchy of \(\alpha_ 0-\), \(\alpha_ 1-\), \(\alpha_ 2-\),... products with certain minor modifications, which are expressed so that, e.g., \(P^{\lambda}_{\alpha_ 0}\) or \(P^*_{\alpha_ 0}\) is written instead of \(P_{\alpha_ 0}.\) We mention some typical questions and results which are discussed or proved in the article. When does \(A\in HSP_{\beta}({\mathcal K})\) hold, where \(P_{\beta}\) is specified as either \(P^{\lambda}_{\alpha_ 0}\) or \(P^*_{\alpha_ 0}\) or \(P^{\lambda}_{\alpha_ 1}\) or \(P^*_{\alpha_ 1}\) or \(P^{\lambda}_{\alpha_ 2}?\) It is algorithmically decidable whether \(A\in HSP_{\beta}({\mathcal K})\) holds, where \({\mathcal K}\) is a finite class and \(P_{\beta}\) is \(P^{\lambda}_{\alpha_ 1}\) or \(P^*_{\alpha_ 1}\) or \(P^{\lambda}_{\alpha_ 2}\). When does \(HSP^{\lambda}_{\beta}({\mathcal K})=HSP^*_{\beta}({\mathcal K})\) hold, where \(\beta\) is \(\alpha_ 0\) or \(\alpha_ 1?\) When is \({\mathcal K}\) homomorphically complete for the product types \(\alpha_ 0^{\lambda}\), \(\alpha^*_ 0\), \(\alpha_ 1^{\lambda}\), \(\alpha^*_ 1?\) There exists a \({\mathcal K}\), consisting of automata with two input symbols only, such that \({\mathcal K}\) is homomorphically complete for the \(\alpha_ 0\)- product.
- scientific article; zbMATH DE number 3852442
- On \(\alpha{}_ 0-\nu{}_ 1\)-products of automata
- scientific article; zbMATH DE number 4024800
- Homomorphically complete classes of automata with respect to the \(\alpha _ 2\)-product
- A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products
- Complete classes of automata for the \(\alpha _ 0\)-product
- A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products
- Results on homomorphic realization of automata by \(\alpha_ 0\)-products
- Varieties of automata and transformation semigroups
- Group axioms for iteration
- On \(\alpha{}_ 0-\nu{}_ 1\)-products of automata
- scientific article; zbMATH DE number 4131682 (Why is no real title available?)
- scientific article; zbMATH DE number 3846880 (Why is no real title available?)
- scientific article; zbMATH DE number 3846882 (Why is no real title available?)
- scientific article; zbMATH DE number 3852441 (Why is no real title available?)
- scientific article; zbMATH DE number 3852442 (Why is no real title available?)
- Homomorphically complete classes of automata with respect to the \(\alpha _ 2\)-product
- scientific article; zbMATH DE number 4035150 (Why is no real title available?)
- scientific article; zbMATH DE number 4098725 (Why is no real title available?)
- scientific article; zbMATH DE number 2099333 (Why is no real title available?)
- Critical classes for the \(\alpha _ 0\)-product
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758249)