Nonterminal complexity of weakly conditional grammars

A weakly conditional grammar is specified as a pair K = (G, G′) where G is a context-free grammar, and G′ is a regular grammar such that a production rule of G is only applicable to the sentential form if it belongs to the language generated by G′. The nonterminal complexity Var(K) of the grammar K...

Full description

Bibliographic Details

Main Authors:	Turaev, Sherzod, Mohd Tamrin, Mohd Izzuddin, Salleh, Norsaremah
Format:	Proceeding Paper
Language:	en en
Published:	Springer International Publishing Switzerland 2014
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/36798/1/26_Nonterminal_Complexity_of_Weakly_Conditional_Grammars_ASIIDS_%282014%29.pdf http://irep.iium.edu.my/36798/4/36798_Nonterminal%20complexity%20of%20weakly%20conditional%20grammars_SCOPUS.pdf http://irep.iium.edu.my/36798/ http://link.springer.com/chapter/10.1007%2F978-3-319-05476-6_6
Tags:	Add Tag No Tags, Be the first to tag this record!