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

DOI10.1016/S0304-3975(02)00848-4MaRDI QIDQ1401334zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Automata networks without any Letichevsky criteria
• Some key problems on finite semigroups
• scientific article; zbMATH DE number 1948518
• scientific article; zbMATH DE number 3896313
• Finite semigroups with infinite product and languages of infinite words.

Cites work

• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Characterizations of locally testable events
• Families of recognizable sets corresponding to certain varieties of finite monoids
• Finite semigroup varieties of the form V*D
• scientific article; zbMATH DE number 3852442 (Why is no real title available?)
• scientific article; zbMATH DE number 3827223 (Why is no real title available?)
• scientific article; zbMATH DE number 4011944 (Why is no real title available?)
• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• scientific article; zbMATH DE number 4037211 (Why is no real title available?)
• scientific article; zbMATH DE number 3495598 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 3287733 (Why is no real title available?)
• Languages of R-trivial monoids
• On finite monoids having only trivial subgroups
• On the Forms of the Predicates in the Theory of Constructive Ordinals

Cited in

(1)

• Automata networks without any Letichevsky criteria

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

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