用于学习系统环境的自动机分解

IF 0.8 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Information and Computation Pub Date : 1988-06-01 DOI:10.1016/0890-5401(88)90047-8

T.H. Westerdale

{"title":"用于学习系统环境的自动机分解","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":"{\"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}","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

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An automaton decomposition for learning system environments

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 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

119

审稿时长

140 days

期刊介绍： 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