scientific article; zbMATH DE number 1979687
A monomial algebra is called automaton algebra if there exists a finite automaton with a language that consists of non-zero words in the algebra \(A\). It is known that any finitely defined monomial algebra is an automaton algebra, however the converse is not always true. It is known also that a monomial algebra is not necessarily an automaton algebra. The paper is devoted to the following question: to recognize for a given automaton algebra (with finite automaton of its non-zero words) whether this algebra is finitely defined or not. An algorithm for recognition whether an arbitrary automaton monomial algebra is finitely defined is introduced. It is shown that this problem can be reduced to the determination of the star height of a regular language and finite definiteness recognition for a certain class of automaton algebras where the problem is algorithmically solvable.
- Monomial algebras
- Regular Gröbner bases
- Recognition of certain properties of automaton algebras.
- On a class of automaton algebras
- scientific article; zbMATH DE number 999598 (Why is no real title available?)
- Recognition of algebraic dependence in finitely generated algebras.
- scientific article; zbMATH DE number 4035155 (Why is no real title available?)
- scientific article; zbMATH DE number 16664 (Why is no real title available?)
- On deterministic finite automata and syntactic monoid size
- On deterministic finite automata and syntactic monoid size, continued
- scientific article; zbMATH DE number 4122153 (Why is no real title available?)
- scientific article; zbMATH DE number 2203336 (Why is no real title available?)
- On deterministic finite automata and syntactic monoid size
- The automata that define representations of monomial algebras.
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 Q4428062)