Algebraic representations for finite-state machines. I. Monoid-ring formulation

DOI10.1016/S0024-3795(96)90006-3zbMath0846.68074MaRDI QIDQ1913649

Jaime Milstein, Thomas L. Moeller

Publication date: 27 May 1996

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

finite-state machinesalgebraic structures

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Generalized algebraic structures for the representation of discrete systems ⋮ Algebraic representations for finite-state machines. II: Module formulation

Cites Work

• Automata Studies. (AM-34)
• RESULTS ON FINITE SEMIGROUPS DERIVED FROM THE ALGEBRAIC THEORY OF MACHINES
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic representations for finite-state machines. I. Monoid-ring formulation