scientific article; zbMATH DE number 1979687

MaRDI QIDQ4428062zbMATH OpenFDO

Authors D. A. Matsnev

Publication date 14 September 2003

zbMATH Keywords

algorithmsfinite automatafinitely presented algebrasmonomial algebrasregular languages

Mathematics Subject Classification ID

Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Computational aspects of associative rings (general theory) (16Z05) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Recognition of certain properties of automaton algebras.
• On a class of automaton algebras
• Primitivity of finitely presented monomial algebras.
• Monomial algebras
• scientific article; zbMATH DE number 16664

Cited in

(14)

• 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?)
• scientific article; zbMATH DE number 1948503 (Why is no real title available?)
• scientific article; zbMATH DE number 2040919 (Why is no real title available?)
• 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)