
Computer Science Computer Science Forum 
 LinkBack  Thread Tools  Display Modes 
March 25th, 2019, 06:17 AM  #1 
Member 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: Question: 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 06:20 AM. 

Tags 
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 12:11 PM 
DFA to Regular Expression  l flipboi l  Computer Science  1  February 2nd, 2012 08:25 AM 
Finite automaton  ferry2  Computer Science  0  January 28th, 2012 10:56 AM 
Regular Expression to NFA  seadoo14  Applied Math  3  October 21st, 2011 04:47 AM 
finite state machine + regular grammar 03  drewerd  Applied Math  0  May 26th, 2009 03:15 PM 