Paper Info
Title
On Form-Equivalence Of Deterministic Pure Grammar Forms
Abstract
Pure grammars are grammars without non-terminals. In this paper we show as one main result that any two acyclic deterministic pure (dP) grammars that generate the same finite language are isomorphic. Furthermore, the notion of a pure grammar form is investigated. As the second main result we show that the form-equivalence problem for dP grammar forms is decidable.
Year
DOI
Venue
1982
10.1016/0304-3975(82)90112-8
THEORETICAL COMPUTER SCIENCE
DocType
Volume
Issue
Journal
18
1
ISSN
Citations 
PageRank 
0304-3975
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
J. Hagauer120.97