Paper Info
Title
A Morphic Representation Of Eol Languages And Other Etol Languages
Abstract
The following morphic characterization of EOL languages is established. The family of EOL languages equals the family of all languages of the form h ( L ∩ R ) where h is a morphism, R is a regular language and L is the maximal solution of an equation ⨍(X) = g(X) , where ⨍ is a morphism, g is a coding and X is a language variable. It is shown that if g is allowed to be a weak coding, then a larger family of languages is obtained, which however is strictly contained in the family of ETOL languages.
Year
DOI
Venue
1985
10.1016/0166-218X(85)90065-4
DISCRETE APPLIED MATHEMATICS
Field
DocType
Volume
Discrete mathematics,Combinatorics,Formal language,Of the form,Coding (social sciences),Regular language,Morphism,Mathematics,Language family
Journal
12
Issue
ISSN
Citations 
2
0166-218X
2
PageRank 
References 
Authors
0.40
4
3
Name
Order
Citations
PageRank
A. Ehrenfeucht11823497.83
G. Rozenberg229864.16
K. Ruohonen320.40