Tag Archives: DFA

Given a string S, the task is to design a Deterministic Finite Automata (DFA) for accepting the language L = C (A + B)+. If… Read More
Given a string R(x) of length n representing an expression having the set of words under the given grammar: For every lowercase letter x, R(x)… Read More
State Elimination Method : Rules to convert a DFA/NFA//Ɛ-NFA into corresponding Regular Expression. Arden’s Method is not capable of converting Ɛ-NFA. By state elimination method… Read More
Given a binary string S, the task is to write a program for DFA Machine that accepts a string with odd numbers of 0s and… Read More
Prerequisite: Introduction to Deterministic Finite Automata Construct a DFA that accepts string str starting with input alphabet ‘a’ but does not contain ‘aab’ as a substring… Read More
Problem Statement: Design a Definite Finite Automata for accepting the permutation of Three a’s and Three b’s over the input {a, b}  Input: S =… Read More
Given a binary string str, the task is to build a DFA that accepts given binary string if it contains “01” i times and “1”… Read More
Given binary string str, the task is to build a DFA that accepts the string if the string either starts with “01” or ends with… Read More
Given a string consisting of characters a and b, check if the string starts and ends with the same character or not. If it does,… Read More
DFA or Deterministic Finite Automata is a finite state machine which accepts a string(under some specific condition) if it reaches a final state, otherwise rejects… Read More