The Gateway to Computer Science Excellence
0 votes
126 views

Use the procedure described in $\text{Lemma 1.60}$ to convert the following finite automata to regular expressions.

in Theory of Computation by Veteran (54.8k points) | 126 views

1 Answer

0 votes

using state elimination method

a. 

b.

by Active (5.1k points)
edited by

Related questions

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,647 questions
56,508 answers
195,519 comments
100,950 users