Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.

DOI10.1016/S0304-3975(02)00848-4zbMath1044.68088OpenAlexW2043793064MaRDI QIDQ1401334

John L. Rhodes, Chrystopher L. Nehaniv, Pál Dömösi

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00848-4

zbMATH Keywords

Algebraic machine theoryCascade products and feedback productsFeedback operators on pseudovarietiesVarieties of formal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Families of recognizable sets corresponding to certain varieties of finite monoids
• Languages of R-trivial monoids
• Finite semigroup varieties of the form V*D
• Characterizations of locally testable events
• On finite monoids having only trivial subgroups
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.