摘要
定义了偶正则表达式（ＰＲＥ），证明了ＰＲＥ和双读头自动机的等价性，为线性语言提供了一种新的有穷表示．
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.
出处
《天津大学学报》
EI
CAS
CSCD
1994年第3期365-369,共5页
Journal of Tianjin University(Science and Technology)
关键词
偶正则表达式
双读头自动机
pair-regular expression
two-head automata
linear grammar
set pair
