edited by
340 views

2 Answers

0 votes
0 votes

CFG ( Context-Free Grammar ) generates CFL ( Context-Free Language ) , and PDA (Push-Down Automata) accepts CFL ( Context-Free Language ).

CSG ( Context-Sensitive Grammar ) generates CSL ( Context-Sensitive Language) , and LBA( Linear Bounded Automata ) accepts CSL ( Context-Sensitive Language).

RG (Regular Grammar) generates RL (Regular Language), and DFA (Deterministic Finite Automata) & NFA (Non-Deterministic Finite Automata) accepts RL (Regular Language).

All languages can be accepted by TM (Turing Machine).

So, the answer is option c) Regular Language

edited by

Related questions

0 votes
0 votes
2 answers
1
gatecse asked Mar 2, 2018
753 views
Bluetooth uses ____ method in physical layer to avoid interference from other devices or other networksFHSSFDSSTDSNone of the above
0 votes
0 votes
1 answer
2
gatecse asked Mar 2, 2018
383 views
In which of the following search agent operates by interleaving computation and action?Offline searchOnline searchBreadth first searchDepth first search
0 votes
0 votes
1 answer
3
gatecse asked Mar 2, 2018
369 views
Which of the following deals with the precise model where accurate solutions are achieved quickly?Soft computingMobile computingHard computingNone of the above
0 votes
0 votes
1 answer
4
gatecse asked Mar 2, 2018
498 views
Supervised learning and unsupervised learning are two board category ofData warehouseDBMSNeural NetworkNone of the above