Institutional Repository
| On equations for regular languages, finite automata, and sequential networks | |
| J. A. Brzozowski; E. Leiss | |
| 1980 | |
| Source | Theoretical Computer Science
 |
| Volume | 10Issue:1Pages:19-35 |
| English Abstract | 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. |
| Indexed Type | 其他 |
| Cooperation Status | 其它 |
| Language | 英语 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/1351 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| BJ01146345.pdf（1672KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment