The automata that define representations of monomial algebras.

DOI10.1007/S10468-007-9063-4zbMATH Open1143.16018OpenAlexW1974547898MaRDI QIDQ930352FDOQ930352

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

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

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)

Cites Work

• Title not available (Why is that?)
• Auslander-reiten sequences with few middle terms and applications to string algebrass
• Title not available (Why is that?)
• Maps between representations of zero-relation algebras

Cited In (3)

• Representations of regular ideals in finite automata
• Title not available (Why is that?)
• Title not available (Why is that?)

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)