A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products (Q1123627)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products |
scientific article; zbMATH DE number 4110129
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products |
scientific article; zbMATH DE number 4110129 |
Statements
A decidability result for homomorphic representation of automata by \(\alpha _ 0\)-products (English)
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
