What are the regular expressions to finite automata?

For each of the following languages, draw the finite automata (FA) accepting it.

{a,b}*{a}

The language states that the automata accept the strings containing any number of a's and b's and finally ending in a.

The finite state automaton for the language is as follows −

{a,b}*{b,aa}{a,b*}

The language states that the automata accept the strings starting and ending with any number of a's and b's and containing any of the substrings b and aa.

The finite state automaton for the language is a follows −

{bbb,baa}*{a}

The language states that the automata accept the strings containing any number of bbb's and baa's followed by a single a.

The final state automaton for the language is as follows −

{a}U{b}{a}*U{a}{b}*{a}

The language states that the automata accept the strings containing a,b followed by number of a's and stings starting with a followed by number of b's and end with a.

The finite state automaton for the language is as follows −

Bhanu Priya

Published on 12-Jun-2021 11:42:20

• Related Questions & Answers
• How to convert the finite automata into regular expressions?
• What are different types of finite automata?
• How to convert Regular expression to Finite Automata?
• What is finite automata?
• How to generate regular expression from finite automata?
• Explain the relationship between Finite Automata and Regular Expression.
• Find out the Regular expression for the given finite automata
• Design finite automata from a given regular expression.
• What is Non deterministic finite automata?
• What are regular expressions in JavaScript?
• What are regular expressions in C#
• Construct a Finite Automata for the regular expression ((a+b)(a+b))*.
• Find the regular expression for the given Finite automata with state elimination method
• Efficient Construction of Finite Automata
• What are the properties of Regular expressions in TOC?