Journal article
A generalized approach to formal languages
Abstract
A generalization of ranked alphabets, many-sorted alphabets, is studied. The concepts of finite automaton, regular, recognizable, equational, and context free languages are generalized to sets over these new alphabets. It is shown that the derivation trees of a context free set are always characterized by some recognizable set over a related many-sorted alphabet. Previous theory is drawn as a special case of these results and new results are …
Authors
Maibaum TSE
Journal
Journal of Computer and System Sciences, Vol. 8, No. 3, pp. 409–439
Publisher
Elsevier
Publication Date
June 1974
DOI
10.1016/s0022-0000(74)80031-0
ISSN
0022-0000