- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
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 −
- Related Articles
- How to convert the finite automata into regular expressions?
- How to convert Regular expression to Finite Automata?
- How to generate regular expression from finite automata?
- What is the conversion of a regular expression to finite Automata (NFA)?
- Explain the relationship between Finite Automata and Regular Expression.
- Design finite automata from a given regular expression.
- Find out the Regular expression for the given finite automata
- What are different types of finite automata?
- What is finite automata?
- 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
- What is Non deterministic finite automata?
- What is Deterministic Finite Automata (DFA)?
- Generate a Regular Expression for a Finite Automata with state elimination method
- What is Finite Automata in Compiler Design?
