On equations for regular languages, finite automata, and sequential networks

ISCAS OpenIR

	On equations for regular languages, finite automata, and sequential networks
	J. A. Brzozowski; E. Leiss
	1980
发表期刊	Theoretical Computer Science
卷号	10 期号:1 页码:19-35
摘要	We consider systems of equations of the form where A is the underlying alphabet, the Xi are variables, the Pi,a are boolean functions in the variables Xi, and each δi is either the empty word or the empty set. The symbols υ and denote concatenation and union of languages over A. We show that any such system has a unique solution which, moreover, is regular. These equations correspond to a type of automation, called boolean automation, which is a generalization of a nondeterministic automation. The equations are then used to determine the language accepted by a sequential network; they are obtainable directly from the network.
收录类别	其他
合作性质	其它
语种	英语
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/1351
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	J. A. Brzozowski,E. Leiss. On equations for regular languages, finite automata, and sequential networks[J]. Theoretical Computer Science,1980,10(1):19-35.
APA	J. A. Brzozowski,&E. Leiss.(1980).On equations for regular languages, finite automata, and sequential networks.Theoretical Computer Science,10(1),19-35.
MLA	J. A. Brzozowski,et al."On equations for regular languages, finite automata, and sequential networks".Theoretical Computer Science 10.1(1980):19-35.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
BJ01146345.pdf（1672KB）			开放获取	使用许可	请求全文