No label defined (Q4428062)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1979687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1979687 |
Statements
14 September 2003
0 references
monomial algebras
0 references
finite automata
0 references
regular languages
0 references
finitely presented algebras
0 references
algorithms
0 references
0.8207594156265259
0 references
0.7833265066146851
0 references
0.7737431526184082
0 references
0.7733103632926941
0 references
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.
0 references