1,096 views
3 votes
3 votes
Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?

1 Answer

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
0 answers
2
OneZero asked Dec 7, 2018
577 views
Why is Regular grammar obtained from DFA always unambiguous?Why Regular grammar obtained from NFA may or may not be ambiguous?
1 votes
1 votes
3 answers
3
kman30 asked Jan 19, 2019
681 views
Virtual memory increases context switching overhead ? Why why not ?
0 votes
0 votes
1 answer
4
admin asked May 1, 2019
527 views
Give a context-free grammar that generates the language $A=\{a^{i}b^{j}c^{k}\mid i=j$ $\text{or}$ $ j=k$ $\text{where}$ $ i,j,k\geq 0\}.$ Is your grammar ambiguous$?$ Why...