# Tag Archives: DFA

Given a string S, the task is to design a Deterministic Finite Automata (DFA) for accepting the language L = {aNbM | N ≥ 0,… Read More
DFA or Deterministic Finite Automata is a finite state machine, in which on every input alphabet a transition is done from one state to another… Read More
Prerequisite :  Designing Finite Automata Introduction :In this article, we will discuss the DFA in LEX Code that accepts the string having even number’s of… Read More
Problem Overview – Design a DFA in LEX Code that accepts the string having even binary number over input alphabet  {0,1}. Example –  Input : 1010… Read More
In this article, we will discuss the overview of the LEX Code that accepts the string with 0 only. And will implement with LEX code… Read More
In this article, we will discuss the LEX Code that accepts the string ending with ‘abb’ over input alphabet  {a,b} and will see the implementation… Read More
In this article, we will discuss how you can solve the problem, and also you will see how you can design problems related to DFA… Read More
In this article, we will discuss the DFA in LEX Code which accepts a string containing the third-last element ‘a’ over input alphabet {a, b}… Read More
Given a string S that represents an integer, the task is to check if the given string S represents an unsigned integer or not by… Read More
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