A homomorphic characterization of regular languages
暂无分享，去创建一个
Abstract Every regular language R (over any alphabet) can be represented in the form R = h 4 h −1 3 h 2 h −1 1 (1∗0) where h 1 , h 2 , h 3 , and h 4 are homomorphisms. Furthermore, if n is sufficiently large, then R = g 3 g −1 2 g 1 ({1, …, n}∗0) where, g 1 , g 2 , and g 3 are homomorphisms.
[1] Hermann A. Maurer,et al. On simple representations of language families , 1979, RAIRO Theor. Informatics Appl..
[2] Karel Culik,et al. HOMOMORPHISMS: DECIDABILITY, EQUALITY AND TEST SETS , 1980 .
[3] Karel Culik. A Purely Homomorphic Characterization of Recursively Enumerable Sets , 1979, JACM.