The Gateway to Computer Science Excellence
0 votes

Can someone please explain me how could we derive the RE from FA's ... Here--

PS- Obviously the answer can be easily obtained using parsing, but how can we derive the regular expression?? Ardent is too lengthy for exam point of view, so explanation with some other technique like state elimination will be appreciated...

in Theory of Computation by Active (1.5k points)
edited by | 222 views

1 Answer

0 votes
Sometimes state elimination become lengthy it depend on the questions nature
by Active (4.4k points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,167 answers
93,998 users