An automaton decomposition for learning system environments

DOI10.1016/0890-5401(88)90047-8zbMath0646.68075OpenAlexW2054547581MaRDI QIDQ1104102

T. H. Westerdale

Publication date: 1988

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(88)90047-8

zbMATH Keywords

finite automatonlearning systemsynchronizercascade decompositionpermutation automatontransition monoid

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algebraic theory of languages and automata (68Q70)

Related Items (1)

Minimality of an automaton cascade decomposition for learning system environments

Cites Work

• Some Applications of the Wreath Product Construction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An automaton decomposition for learning system environments