Language classes generated by tree controlled grammars with bounded nonterminal complexity

Language classes generated by tree controlled grammars with bounded nonterminal complexity

A tree controlled grammar is specified as a pair (G, G′) where G is a context-free grammar and G′ is a regular grammar. Its language consists of all terminal words with a derivation in G such that all levels of the corresponding derivation tree – except the last level – belong to L(G′). We define th...

Full description

Bibliographic Details
Main Authors: Turaev, Sherzod, Dassow, Juergen, Manea, Florin, Selamat, Mohd Hasan
Format: Article
Language:English
Published: Elsevier 2012
Subjects:
QA Mathematics
QA75 Electronic computers. Computer science
Online Access:http://irep.iium.edu.my/27237/
http://irep.iium.edu.my/27237/1/Language_classes_generated_by_tree_controlled_grammars_with_bounded_nonterminal_complexity.pdf

Similar Items

Similar Items