0 votes 0 votes Context-free grammar can be recognized by finite state automation $2$- way linear bounded automata push down automata both (B) and (C) Compiler Design nielit2016mar-scientistc compiler-design parsing + – admin asked Apr 2, 2020 • recategorized Oct 28, 2020 by Krithiga2101 admin 6.2k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply smsubham commented Apr 2, 2020 reply Follow Share Same question https://gateoverflow.in/53013/cfg 0 votes 0 votes smsubham commented Apr 2, 2020 reply Follow Share What is 2 way Linear Bounded automata? Is it same as LBA? 0 votes 0 votes Please log in or register to add a comment.
6 votes 6 votes Context-free Grammar (CFG) can be recognized by both 2-way linear bounded automata and push down automata . regular --> dcfl --> ncfl --> Csl --> recursive -->recursive enumerable (implication) Kapil answered Jun 24, 2016 Kapil comment Share Follow See all 2 Comments See all 2 2 Comments reply Pawan Prusty commented Jul 7, 2017 reply Follow Share but the question asked here is regarding CFG not CFL 0 votes 0 votes Prajna commented Jul 9, 2019 reply Follow Share 2-way linear bounded automata , linear bounded automata both are same? 0 votes 0 votes Please log in or register to add a comment.
4 votes 4 votes Automata Recognized Grammar Finite Automata Regular Grammar PDA CFG LBA CSG TM REG So Ans is B. 2-way LinearBounded Automata(it called so bcz Here TM's Tapes both sides are restricted) Rajesh Pradhan answered Jun 24, 2016 Rajesh Pradhan comment Share Follow See all 2 Comments See all 2 2 Comments reply ankit commented Sep 5, 2016 reply Follow Share Unrestricted Grammar and RECURSIVE Enumerable grammar are same or not ?? 1 votes 1 votes KhushiRastogi commented May 16, 2023 reply Follow Share same 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes (B)2 way Linear Bounded Automata Reference:Context Sensitive grammar LeenSharma answered Jun 24, 2016 LeenSharma comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Context free Grammar can be recognize by both Linear Bounded Automata (LBA) and Push down Automata (PDA). Hence,Option (D)Both B and C is the correct choice. LeenSharma answered Jun 24, 2016 LeenSharma comment Share Follow See all 0 reply Please log in or register to add a comment.