论文信息 - Representation Theorems on Regular Languages

Representation Theorems on Regular Languages

Let T denote the set of regular operators, concatenation (·), union (∪), and star(∗). For any subset Ω of T, any regular language R, and any finite class C of relgular languages, R is said to have a Ω-representation over C if R can be obtained by a finite number of applications of operators in Ω to C This paper shows that there exist algorithms for deciding whether or not an arbitrary regular language has a Ω-representation over an arbitrary class C of regular languages for any subset Ω of T.

K. Hashiguchi | K. Hashiguchi

[1] Kosaburo Hashiguchi,et al. Limitedness Theorem on Finite Automata with Distance Functions , 1982, J. Comput. Syst. Sci..

[2] Imre Simon,et al. Limited subsets of a free monoid , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[3] Kosaburo Hashiguchi,et al. The Star Height of Reset-Free Events and Strictly Locally Testable Events , 1979, Inf. Control..

[4] L. Eggan. Transition graphs and the star-height of regular events. , 1963 .

[5] R. McNaughton,et al. Counter-Free Automata , 1971 .

[6] Matti Linna. Finite Power Property of Regular Languages , 1972, ICALP.

[7] Kosaburo Hashiguchi,et al. A Decision Procedure for the Order of Regular Events , 1979, Theor. Comput. Sci..