{"title":"An automaton decomposition for learning system environments","authors":"T.H. Westerdale","doi":"10.1016/0890-5401(88)90047-8","DOIUrl":null,"url":null,"abstract":"<div><div>A finite automaton two-component cascade decomposition is presented in which the first component has a synchronizer and the second component is a permutation automaton. The synchronizer corresponds to a primitive idempotent element <em>e</em> in the transition monoid <em>M</em> of the automaton. The state set of the second component is the range of <em>e</em>; each state of the first component is an image of this range under one of the transitions in <em>M</em>. The transition monoid of the second component is the group <em>eMe</em>. as a conceptual tool, the decomposition can be used to clarify the credit assignment problems faced by learning system reward schemes in finite automaton environments.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"77 3","pages":"Pages 179-191"},"PeriodicalIF":0.8000,"publicationDate":"1988-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0890540188900478","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
A finite automaton two-component cascade decomposition is presented in which the first component has a synchronizer and the second component is a permutation automaton. The synchronizer corresponds to a primitive idempotent element e in the transition monoid M of the automaton. The state set of the second component is the range of e; each state of the first component is an image of this range under one of the transitions in M. The transition monoid of the second component is the group eMe. as a conceptual tool, the decomposition can be used to clarify the credit assignment problems faced by learning system reward schemes in finite automaton environments.
期刊介绍：
Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as
-Biological computation and computational biology-
Computational complexity-
Computer theorem-proving-
Concurrency and distributed process theory-
Cryptographic theory-
Data base theory-
Decision problems in logic-
Design and analysis of algorithms-
Discrete optimization and mathematical programming-
Inductive inference and learning theory-
Logic & constraint programming-
Program verification & model checking-
Probabilistic & Quantum computation-
Semantics of programming languages-
Symbolic computation, lambda calculus, and rewriting systems-
Types and typechecking
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
