Register

Recent questions tagged finite-automata

0 votes
2 answers
901
Find the number of strings in finite automata:
Given finite automate accepts strings of length 6. How many strings are there in the set? a. 18 b. 20 c. 30 d. 32
Given finite automate accepts strings of length 6.How many strings are there in the set?a. 18b. 20c. 30d. 32
User Avatar
1 votes
1 answer
902
#Toc #PeterLinz
Find a DFA for the following language on {a,b} L = { w : ( na(w) + 2nb(w)) mod 3 < 2 }
Find a DFA for the following language on {a,b}L = { w : ( na(w) + 2nb(w)) mod 3 < 2 }
User Avatar
2 votes
1 answer
903
#TOC #PeterLinz
Find a DFA for the following language on {a,b} L = { w : ( na(w) - nb(w)) mod 3 >0 }
Find a DFA for the following language on {a,b}L = { w : ( na(w) - nb(w)) mod 3 >0 }
User Avatar
2 votes
2 answers
904
Regular Expression time complexity
The equality of two regular expression is computed in? Give reasons also.. Constant Time polynomial time logarithmic Polynomial time Exponential time
The equality of two regular expression is computed in? Give reasons also..Constant Timepolynomial timelogarithmic Polynomial timeExponential time
User Avatar
8 votes
3 answers
906
ISRO2014-79
Consider the following Deterministic Finite Automaton $M$. Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of strings in $S$ that are accepted by $M$ is 0 1 2 3
Consider the following Deterministic Finite Automaton $M$.Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of str...
User Avatar
3 votes
3 answers
907
Finite Automata
There are exactly ______different finite automata with 3 states x,y,and z over the alphabet {a,b} where x is always the start state 1)64 2) 256 3) 1024 4)5832
There are exactly ______different finite automata with 3 states x,y,and z over the alphabet {a,b} where x is always the start state1)64 2) 256 3) 1024 4)5832
User Avatar
2 votes
3 answers
909
TOC John C Martin Finite Automata
Draw an FA accepting the language of all strings that begin or end with aa or bb, where indicated language is over {a, b} .
Draw an FA accepting the language of all strings that begin or end with aa or bb, where indicated language is over {a, b} .
User Avatar
2 votes
1 answer
910
Theory Of Computation
To complement the language , we complement the machine by altering final/non-final states. My question is , should that machine necessarily be a DFA? Can't we apply the same concept to NFA?
To complement the language , we complement the machine by altering final/non-final states.My question is , should that machine necessarily be a DFA? Can't we apply the sa...
User Avatar
1 votes
3 answers
911
NFA to DFA
NFA can be converted into DFA using Sub set construction method Lazy evaluation method either A or B both A and B
NFA can be converted into DFA usingSub set construction methodLazy evaluation methodeither A or Bboth A and B
User Avatar
2 votes
1 answer
912
Finite Automation
A language L is accepted by finite automata if and only if it is Right linear Primitive Recursive Context Sensitive Recursive
A language L is accepted by finite automata if and only if it isRight linearPrimitive RecursiveContext SensitiveRecursive
User Avatar
7 votes
5 answers
913
ISRO2014-33
The following Finite Automaton recognizes which of the given languages? $\{ 1, 0 \}^* \{ 0 1 \}$ $\{ 1,0\}^*\{ 1\}$ $\{ 1 \} \{1, 0\}^*\{ 1 \}$ $1^*0^*\{0,1\}$
The following Finite Automaton recognizes which of the given languages?$\{ 1, 0 \}^* \{ 0 1 \}$$\{ 1,0\}^*\{ 1\}$$\{ 1 \} \{1, 0\}^*\{ 1 \}$$1^*0^*\{0,1\}$
User Avatar
1 votes
1 answer
914
DFA Finite Automata
Construct a DFA to accept all strings (1+0)^ with an equal no of zeros and 1's ,such that each prefix has atmost one more zero then 1's and at most one more 1's then zeros .
Construct a DFA to accept all strings (1+0)^ with an equal no of zeros and 1's ,such that each prefix has atmost one more zero then 1's and at most one more 1's then zero...
User Avatar
1 votes
2 answers
917
Automata Regular expression
If r1 and r2 are 2 Regular Expression Such that r1 = (a+b)* r2 = (a*+b*+a*b*+b*a*) What are the different case's in which r1 = r2 ? Please Explain with an example
If r1 and r2 are 2 Regular Expression Such thatr1 = (a+b)* r2 = (a*+b*+a*b*+b*a*)What are the different case's in which r1 = r2 ?Please Explain with an example
User Avatar
0 votes
1 answer
918
Automata Grammar Language
Write a Grammar which is a not type -3 Grammar, from the Language L over alphabets {a ,b} which contains ab as a Sub-string. Explain the procedure with Example .
Write a Grammar which is a not type -3 Grammar, from the Language L over alphabets {a ,b} which contains ab as a Sub-string. Explain the procedure with Example .
User Avatar
0 votes
1 answer
919
Min No of states in FA .
L =Set of all string which starts with a and ends with a .what will be the min no of states in FA represented by this Lang.
L =Set of all string which starts with a and ends with a .what will be the min no of states in FA represented by this Lang.
User Avatar
1 votes
1 answer
921
Finite Automata
( a*+b*+a*b*+b*a* ) can we derive string abab and abba from this regular expression. what is the relationship between ( a*+b*+a*b*+b*a* ) and (a+b)*
( a*+b*+a*b*+b*a* ) can we derive string abab and abba from this regular expression. what is the relationship between ( a*+b*+a*b*+b*a* ) and (a+b)*
User Avatar
2 votes
2 answers
922
Finite Automata
How many different finite automata are possible with three states x, y and z over the alphabet {a, b} where x is always the start state. Justify your Answer with Example .
How many different finite automata are possible with three states x, y and z over the alphabet {a, b} where x is always the start state.Justify your Answer with Example ....
User Avatar
11 votes
2 answers
930
CMI2010-B-04c
Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers. If a language $L$ is accepted by an NFA with $n$ states then there is a DFA with no more than $2^n$ states accepting $L$.
Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers.If a language $L$ is accepted by an NFA with $n$ sta...
User Avatar
Page: