Analogical Conception of Chomsky Normal Form and Greibach Normal Form for Linear, Monadic Context-Free Tree Grammars

Authors:
Akio Fujiyoshi
Affiliations:
The author is with the Department of Computer and Information Sciences, Ibaraki University, Hitachi-shi, 316--8511 Japan. E-mail: fujiyosi@mx.ibaraki.ac.jp
Venue:
IEICE - Transactions on Information and Systems
Year:
2006

Citing 0
Cited 1

Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the analogical conception of Chomsky normal form and Greibach normal form for linear, monadic context-free tree grammars (LM-CFTGs). LM-CFTGs generate the same class of languages as four well-known mildly context-sensitive grammars. It will be shown that any LM-CFTG can be transformed into equivalent ones in both normal forms. As Chomsky normal form and Greibach normal form for context-free grammars (CFGs) play a very important role in the study of formal properties of CFGs, it is expected that the Chomsky-like normal form and the Greibach-like normal form for LM-CFTGs will provide deeper analyses of the class of languages generated by mildly context-sensitive grammars.