Similar Topics
DSA
20.6k+ articles
Strings
3k+ articles
Sorting
1.7k+ articles
GATE CS
1.5k+ articles
Algorithms
1.2k+ articles
Pattern Searching
570+ articles
binary-string
380+ articles
Theory of Computation
260+ articles
Compiler Design
250+ articles
permutation
240+ articles

DFA

20+ posts

Popular articles
Recent articles
Program to construct a DFA which accepts the language having all 'a' before all 'b'
Last Updated: 14 December 2021
Given a string S, the task is to design a Deterministic Finite Automata (DFA) for accepting the language L = {aNbM | N ≥ 0, M ≥ 0, N+M ≥ 1}. , i.e., a regular language L s...read more
image
Strings
binary-string
Theory of Computation
DFA
DSA
Implementing DFA for no runs of length less than 4 for input (a,b)
Last Updated: 08 March 2023
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 state according to set of d...read more
image
Strings
Pattern Searching
Theory of Computation
DFA
DSA
LEX Code that accepts string having even number's of 'a' over input alphabet {a,b}
Last Updated: 26 July 2021
Prerequisite : Designing Finite AutomataIntroduction :In this article, we will discuss the DFA in LEX Code that accepts the string having even number's of 'a' over input a...read more
image
Compiler Design
DFA
Similar Topics
DSA
20.6k+ articles
Strings
3k+ articles
Sorting
1.7k+ articles
GATE CS
1.5k+ articles
Algorithms
1.2k+ articles
Pattern Searching
570+ articles
binary-string
380+ articles
Theory of Computation
260+ articles
Compiler Design
250+ articles
permutation
240+ articles
LEX Code that accepts the string ending with 'abb' over input alphabet {a,b}
Last Updated: 23 July 2021
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 using LEX code and will u...read more
image
Theory of Computation
DFA
LEX Code to Identify and print Integer & Float Constants and Identifier
Last Updated: 26 September 2022
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 in LEX Code to Identify and print Integer ...read more
image
Theory of Computation
DFA
Program to construct a DFA to check if a given integer is unsigned or not
Last Updated: 20 July 2022
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 constructing the DFA. If the given string ...read more
image
Strings
Compiler Design
Theory of Computation
DFA
DSA
Program to construct DFA for Regular Expression C( A + B)+
Last Updated: 10 February 2022
Given a string S, the task is to design a Deterministic Finite Automata (DFA) for accepting the language L = C (A + B)+. If the given string is accepted by DFA, then print...read more
image
Strings
Compiler Design
Theory of Computation
DFA
DSA
State Elimination Method convert DFA/NFA/Ɛ-NFA into Regular Expression
Last Updated: 11 November 2020
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 m...read more
image
GATE CS
Theory of Computation
DFA
regular-expression
Program to construct DFA accepting odd number of 0s and odd number of 1s
Last Updated: 07 June 2021
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 1s.Examples:Input: S = "010011"Output: AcceptedExp...read more
image
Strings
binary-string
CS - Placements
Theory of Computation
DFA
DSA
DFA that begins with 'a' but does not contain substring 'aab'
Last Updated: 09 August 2021
Prerequisite: Introduction to Deterministic Finite AutomataConstruct a DFA that accepts string str starting with input alphabet 'a' but does not contain 'aab' as a substri...read more
image
Strings
Algorithms
Theory of Computation
substring
DFA
DSA
Design a DFA that accepts a string containing 3 a's and 3 b's
Last Updated: 15 February 2023
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 = "aaabbb"Output: AcceptedExpla...read more
image
Strings
Algorithms
permutation
Theory of Computation
DFA
DSA
Build a DFA to accept a binary string containing "01" i times and "1" 2j times
Last Updated: 30 March 2023
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" 2j times, i.e.,[Tex]L={(01)^i (1)^{2j} \text{ wh...read more
image
Algorithms
binary-string
Theory of Computation
DFA
DSA
Build a DFA to accept Binary strings that starts or ends with "01"
Last Updated: 26 November 2021
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 "01".Input: str = "010000"Output: AcceptedEx...read more
image
Strings
Articles
Algorithms
Pattern Searching
binary-string
Theory of Computation
DFA
DSA
Program to build a DFA to accept strings that start and end with same character
Last Updated: 15 December 2022
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, print 'Yes' else print 'No'.Examples:Input...read more
image
Strings
Pattern Searching
Theory of Computation
DFA
DSA
Program to build a DFA that checks if a string ends with "01" or "10"
Last Updated: 14 September 2022
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 it.Prob...read more
image
Strings
Pattern Searching
DFA
DSA
1 2 >>
Last
1 2 >>
Last
1 2 >>
Last
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox