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...
| Main Authors: | , , |
|---|---|
| Format: | Proceeding Paper |
| Language: | English English |
| Published: |
Springer International Publishing Switzerland
2014
|
| Subjects: | |
| 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 |
| _version_ | 1796878794289577984 |
|---|---|
| author | Turaev, Sherzod Mohd Tamrin, Mohd Izzuddin Salleh, Norsaremah |
| author_facet | Turaev, Sherzod Mohd Tamrin, Mohd Izzuddin Salleh, Norsaremah |
| author_sort | Turaev, Sherzod |
| collection | IIUM |
| description | 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 is defined as the sum of the numbers of nonterminals of G and G′. This paper studies the nonterminal complexity of weakly conditional grammars, and it proves that every recursively enumerable language can be generated by a weakly conditional grammar with no more than ten nonterminals. Moreover, it shows that the number of nonterminals in such grammars without erasing rules leads to an infinite hierarchy of families of languages generated by weakly conditional grammars. |
| first_indexed | 2024-03-05T23:26:34Z |
| format | Proceeding Paper |
| id | oai:generic.eprints.org:36798 |
| institution | International Islamic University Malaysia |
| language | English English |
| last_indexed | 2024-03-05T23:26:34Z |
| publishDate | 2014 |
| publisher | Springer International Publishing Switzerland |
| record_format | dspace |
| spelling | oai:generic.eprints.org:367982017-09-26T02:53:24Z http://irep.iium.edu.my/36798/ Nonterminal complexity of weakly conditional grammars Turaev, Sherzod Mohd Tamrin, Mohd Izzuddin Salleh, Norsaremah QA75 Electronic computers. Computer science 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 is defined as the sum of the numbers of nonterminals of G and G′. This paper studies the nonterminal complexity of weakly conditional grammars, and it proves that every recursively enumerable language can be generated by a weakly conditional grammar with no more than ten nonterminals. Moreover, it shows that the number of nonterminals in such grammars without erasing rules leads to an infinite hierarchy of families of languages generated by weakly conditional grammars. Springer International Publishing Switzerland 2014 Proceeding Paper PeerReviewed application/pdf en http://irep.iium.edu.my/36798/1/26_Nonterminal_Complexity_of_Weakly_Conditional_Grammars_ASIIDS_%282014%29.pdf application/pdf en http://irep.iium.edu.my/36798/4/36798_Nonterminal%20complexity%20of%20weakly%20conditional%20grammars_SCOPUS.pdf Turaev, Sherzod and Mohd Tamrin, Mohd Izzuddin and Salleh, Norsaremah (2014) Nonterminal complexity of weakly conditional grammars. In: 6th Asian Conference, ACIIDS 2014, 7th-9th April 2014, Bangkok, Thailand. http://link.springer.com/chapter/10.1007%2F978-3-319-05476-6_6 10.1007/978-3-319-05476-6_6 |
| spellingShingle | QA75 Electronic computers. Computer science Turaev, Sherzod Mohd Tamrin, Mohd Izzuddin Salleh, Norsaremah Nonterminal complexity of weakly conditional grammars |
| title | Nonterminal complexity of weakly conditional grammars |
| title_full | Nonterminal complexity of weakly conditional grammars |
| title_fullStr | Nonterminal complexity of weakly conditional grammars |
| title_full_unstemmed | Nonterminal complexity of weakly conditional grammars |
| title_short | Nonterminal complexity of weakly conditional grammars |
| title_sort | nonterminal complexity of weakly conditional grammars |
| topic | QA75 Electronic computers. Computer science |
| url | 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 |
| work_keys_str_mv | AT turaevsherzod nonterminalcomplexityofweaklyconditionalgrammars AT mohdtamrinmohdizzuddin nonterminalcomplexityofweaklyconditionalgrammars AT sallehnorsaremah nonterminalcomplexityofweaklyconditionalgrammars |