My Math Forum  

Go Back   My Math Forum > Science Forums > Computer Science

Computer Science Computer Science Forum

LinkBack Thread Tools Display Modes
March 25th, 2019, 07:17 AM   #1
Joined: Oct 2017
From: Rumba

Posts: 39
Thanks: 0

Regular Expression (Finite Automaton)

Please could someone advice which solution is correct:

Write down a regular expression which denotes the language accepted by the finite automaton:


DFA converted:

From answers i have been told:

a) b*a(b+a)*a(a+b)*

b) (a+b)*aa(a+b)*

c) (a+b+ab)*aa(a+b)*

d) (b+ba+aa+ ab+ b) *

Which one would you suggest as correct?

Last edited by sita; March 25th, 2019 at 07:20 AM.
sita is offline  
October 26th, 2019, 09:10 AM   #2
Joined: May 2013

Posts: 57
Thanks: 5

q0 a -> (q0,q1)
q0 b -> q0
(q0,q1) a -> (q0,q1,q2)
(q0,q1) b -> q0
(q0,q1,q2) a -> (q0,q1,q2)
(q0,q1,q2) b -> (q0,q1,q2)
based on this, i'd say a) is the closest.
phillip1882 is offline  

  My Math Forum > Science Forums > Computer Science

automaton, expression, finite, regular

Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Nondeterministic finite automaton (understanding problem) andictatus Computer Science 1 October 29th, 2014 01:11 PM
DFA to Regular Expression l flipboi l Computer Science 1 February 2nd, 2012 09:25 AM
Finite automaton ferry2 Computer Science 0 January 28th, 2012 11:56 AM
Regular Expression to NFA seadoo14 Applied Math 3 October 21st, 2011 05:47 AM
finite state machine + regular grammar 03 drewerd Applied Math 0 May 26th, 2009 04:15 PM

Copyright © 2019 My Math Forum. All rights reserved.