Question: Regular expression {0,1} is equivalent to
Options
A : 0 U 1
B : 0 / 1
C : 0 + 1
D : All of the mentioned
Properties-Non Regular Languages more questions
Finite state machine are not able to recognize Palindromes because:
Given languages:^ i) {anbn|n>=0}^ ii) <div>n</div>n^ iii) {w?{a,b}?| #a(w)=#b(w)}, #....
Myphill Nerode does the following:
Precedence of regular expression in decreasing order is
Regular expression ?* is equivalent to
Which of the following are related to tree automaton?
Which of the following options is incorrect?
Consider following regular expression^ i) (a/b)* ii) (a*/b*)* iii) ((?/a)b*)*^....
Ambiguous Grammar more Online Exam Quiz
Deterministic Finite Automata-Introduction and Definition
Finding Patterns in Text,Algebric Laws and Derivatives
From Grammars to Push Down Automata
Node-Cover Problem, Hamilton Circuit Problem
Problem Solvable in Polynomial Time
Regular Language & Expression - 1
Turing Machine-Notation and Transition Diagrams
Engine Components - Connecting Rod