Syntactic complexity of scattered context grammars
The syntactic complexity of scattered context grammars with respect to the number of nonterminals is investigated. First, the family of the recursively enumerable languages is characterized by some basic operations, such as quotient and coding, over the languages generated by propagating scattered c...
|Published in:||Acta Informatica, Vol. 32, No. 3 (1995), p. 285-298|
|QR Code:||Show QR Code|