Register

Recent questions tagged finite-automata

1 votes
1 answer
871
How many final states ?
How many final states required in the equivalent DFA ?
How many final states required in the equivalent DFA ?
User Avatar
1 votes
1 answer
872
Theory of computation
Set of all strings over {0,1} containing at most one pair of consecutive 1's. Give regular expression and equivalent minimized DFA.
Set of all strings over {0,1} containing at most one pair of consecutive 1's.Give regular expression and equivalent minimized DFA.
User Avatar
1 votes
1 answer
873
DFA sub :TOC
construct a dfa :all string with at-least one a and exactly two b's ,
construct a dfa :all string with at-least one a and exactly two b's ,
User Avatar
1 votes
2 answers
875
Mininmal DFA
What will a minimal DFA over alphabet {a,b} which accepts all strings in which second symbol from RHS is always 'a' look like?
What will a minimal DFA over alphabet {a,b} which accepts all strings in which second symbol from RHS is always 'a' look like?
User Avatar
3 votes
1 answer
876
Video Lectures by Shai Simonson
Are the Video Lectures by Shai Simonson self sufficient for GATE or do they miss out on certain parts ?
Are the Video Lectures by Shai Simonson self sufficient for GATE or do they miss out on certain parts ?
User Avatar
2 votes
1 answer
877
self doubt
Convert into regular expression using state elimination method.
Convert into regular expression using state elimination method.
User Avatar
3 votes
2 answers
878
DFA
What is the language accepted by the following DFA ... ending with zero set of all strings starting and ending with zero 2nd option is true but what abut the 3rd option it is also Correct I Guess
What is the language accepted by the following DFA $\Sigma=(0,1)?Set of strings starting with 0 and have odd number of switchings (from 0 to 1 or 1 to 0, for example, 101...
User Avatar
3 votes
2 answers
879
No of DFA
How many number of FA are possible with N states (Q1,Q1,........Qn) for input alphabet {1,2,3,........m} ,where Q1 is always initial state ?
How many number of FA are possible with N states (Q1,Q1,........Qn) for input alphabet {1,2,3,........m} ,where Q1 is always initial state ?
User Avatar
3 votes
3 answers
880
DFA
How many number of DFA's are possible with 2 states X and Y for input alphabet {0,1}?
How many number of DFA's are possible with 2 states X and Y for input alphabet {0,1}?
User Avatar
8 votes
3 answers
881
DFA
Construct a minimal DFA which accepts set of all strings over {a,b} such that second symbol from RHS is 'a'.
Construct a minimal DFA which accepts set of all strings over {a,b} such that second symbol from RHS is 'a'.
User Avatar
5 votes
3 answers
883
Theory Of Computation, Chapter 2, Exercises 2 (e) Minimal DFA
Construct a minimal DFA for the given language. How to find the union of two DFA's ?
Construct a minimal DFA for the given language.How to find the union of two DFA's ?
User Avatar
2 votes
2 answers
886
Toc
{a(kn)|k>=0 n is fixed digit} minimum no of states in DFA a) k b) n c) k+1 d) n+1
{a(kn)|k>=0 n is fixed digit} minimum no of states in DFAa) kb) nc) k+1d) n+1
User Avatar
3 votes
6 answers
889
Introduction to theory of computing by "Michael sipser" 3rd edition page no:37
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
User Avatar
1 votes
0 answers
890
Toc ommon data question
Pl solve and answer ques 9 and 10,,
Pl solve and answer ques 9 and 10,,
User Avatar
1 votes
2 answers
891
UGC NET CSE | September 2013 | Part 2 | Question: 13
The number of states in a minimal deterministic finite automaton corresponding to the language $L=\{ a^n \mid n \geq 4 \}$ is 3 4 5 6
The number of states in a minimal deterministic finite automaton corresponding to the language $L=\{ a^n \mid n \geq 4 \}$ is3456
User Avatar
2 votes
1 answer
892
Regular language
Is the following language a regular language.: L={ (a^p)*|p is a prime no} ....? If so, then how many min no of states in NFA that accepts a lang L?
Is the following language a regular language.:L={ (a^p)*|p is a prime no} ....?If so, then how many min no of states in NFA that accepts a lang L?
User Avatar
6 votes
2 answers
894
UGC NET CSE | December 2012 | Part 3 | Question: 47
The minimum number of states of the non-deterministic finite automaton which accepts the language $\{ a b a b^n \mid n \geq 0 \} \cup \{ a b a^n \mid n \geq 0 \}$ is 3 4 5 6
The minimum number of states of the non-deterministic finite automaton which accepts the language$\{ a b a b^n \mid n \geq 0 \} \cup \{ a b a^n \mid n \geq 0 \}$ is3456
User Avatar
0 votes
2 answers
897
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
898
#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
899
#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
900
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
Page: