A grammar that produces more than one parse tree for some sentence is called
Posted: Mar 05, 2013
View Details
Which of the following statement is wrong ?
Posted: Mar 05, 2013
View Details
Context free language are closed under
Posted: Mar 05, 2013
View Details
The language L = (0n 1n 2n where n > 0) is a
Posted: Mar 05, 2013
View Details
What is Arden’s Theorem?
Posted: Mar 05, 2013
View Details
What are the components of Finite automaton model?
Posted: Mar 05, 2013
View Details
What is Moore machine and Mealy machine?
Posted: Mar 05, 2013
View Details
What are the applications of automata theory?
Posted: Mar 05, 2013
View Details
Give the examples/applications designed as finite state system.
Posted: Mar 05, 2013
View Details
Why are switching circuits called as finite state systems?
Posted: Mar 05, 2013
View Details
Showing 31 to 45 of 348 results