The automata that define representations of monomial algebras.

DOI10.1007/S10468-007-9063-4MaRDI QIDQ930352zbMATH OpenOpenAlexFDO

Authors Sarah Rees

Publication date 30 June 2008

Published in Algebras and Representation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10468-007-9063-4

zbMATH Keywords

finite state automatastring algebrasmonomial algebrasquotients of path algebras

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Representations of quivers and partially ordered sets (16G20)

Recommendations

• scientific article; zbMATH DE number 999598
• scientific article; zbMATH DE number 1979687
• On a class of automaton algebras
• Automata algebras
• Automata determined by varieties of algebras
• A Geometric Characterization of Automatic Monoids
• Recognition of certain properties of automaton algebras.
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS

Cites work

• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• Auslander-reiten sequences with few middle terms and applications to string algebrass
• Maps between representations of zero-relation algebras

Cited in

(3)

• Representations of regular ideals in finite automata
• scientific article; zbMATH DE number 4122153 (Why is no real title available?)
• scientific article; zbMATH DE number 999598 (Why is no real title available?)

This page was built for publication: The automata that define representations of monomial algebras.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930352)