Even number of a's
ab as a substring
empty set
All strings except the empty set over the alphabet {0.1}
Accept empty string and 0
every odd position of the string w is 1
begins with 1 ends with 0
{w| w contains at least 3 ones }
{w|w contains the substring 0101 ie; w=x0101y for some x and y}
{w|w has length at least 3 and its third symbol is a zero}
{w|w starts with 0 and has odd length , or starts with 1 and has even length }
construct a DFA which accepts the language L = {a^N | N ≥ 1}
String in {a,b} with odd number of a's
starting with 01 over the alphabet [1,0}
Strings ending with abc
Program to build a DFA that checks if a string ends with "01" or "10"
build a DFA to accept strings that start and end with same character
build DFA that starts and end with 'a' from input (a, b)
build a DFA that accepts strings starting and ending with different character
DFA of a string starting with 0 and ends with 10?
DFA of a string of a's and b's starting with ab
Draw a DFA to accept string of 0’s and 1’s ending with the string 011.
L= {011, 0011, 1011, 00011, 01011, 10011, 11011, ...}
Binary numbers divisible by 3
binary number divisible by 3 are 0, 011, 110, 1001, 1100, 1111, 10010 etc.
DFA recognizes the language EVEN-EVEN of strings over Σ a,b having
even number of a’s and
even number of b’s.
Starting and ending with aa
{w|w doesnt contain the substring 110}
{w length of w is at most 5 }
{w | contains atleast two 0s and at most one 1 }
DFA to accept Binary strings that starts or ends with "01"
Design a DFA such that: L ={a^n b^m | n,m >= 1}
Comments
Post a Comment