| 偶正则表达式和双读头自动机 |
| |
| 引用本文： | 刘伯莹,周玉清.偶正则表达式和双读头自动机[J].天津大学学报(自然科学与工程技术版),1994,27(3):365-369. |
| |
| 作者姓名： | 刘伯莹 周玉清 |
| |
| 摘 要： | 定义了偶正则表达式，证明了ＰＲＥ和双读头自动机的等价机，为线性语言提供了一种新的有穷表示。
|
| 关 键 词： | 偶正则表达式 双读头自动机 |
PAIR-REGULAR EXPRESSIONS AND TWO-HEAD AUTOMATA |
| |
| Liu Boying,Zhou Yuqing.PAIR-REGULAR EXPRESSIONS AND TWO-HEAD AUTOMATA[J].Journal of Tianjin University(Science and Technology),1994,27(3):365-369. |
| |
| Authors: | Liu Boying Zhou Yuqing |
| |
| Institution: | Liu Boying;Zhou Yuqing(Dept.of Tech.Eec. & System Eng.)(Debt. of Computer Set. & Eng.) |
| |
| Abstract: | As a finite representation method of formal langUages, expressions haven't yetbeen studied efficiently.In this paper, the concept of pair-regular expressions(PRE)is presented.The equivalence between PRE and the two head automata given in literature is proved and anew finite represention method of linear languages is given. |
| |
| Keywords: | pair-regular expression two-head automata linear grammar set pair |
| 本文献已被 CNKI 维普 等数据库收录！ |
