An automaton decomposition for learning system environments

DOI10.1016/0890-5401(88)90047-8zbMATH Open0646.68075OpenAlexW2054547581MaRDI QIDQ1104102FDOQ1104102

Authors: 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

Recommendations

• Minimality of an automaton cascade decomposition for learning system environments
• scientific article; zbMATH DE number 8122
• scientific article; zbMATH DE number 3988720
• scientific article; zbMATH DE number 3890741
• scientific article; zbMATH DE number 3940736

zbMATH Keywords

finite automatonsynchronizercascade decompositionlearning systempermutation automatontransition monoid

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some Applications of the Wreath Product Construction
• Title not available (Why is that?)

Cited In (3)

• Minimality of an automaton cascade decomposition for learning system environments
• Title not available (Why is that?)
• Title not available (Why is that?)

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

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