InsideDarkWeb.com

Regular Expression describing language accepted by Finite State Automata

Finite State Automata

Hopefully I am including the image correctly or this won’t make any sense. I am trying to figure out a regular expression for what this FSA accepts. From what I can tell it accepts any combination of 01 or 10 repeated. Wouldn’t the expression then be ((01)* | (10)*) *

I believe I have what it should be as correct I just don’t know if I am representing that answer as a regular expression in the correct form. Any help would be appreciated

Mathematics Asked by AWu on November 12, 2021

1 Answers

One Answer

Your regular expression is correct, though I, like rain1, would simplify it to $(01mid 10)^*$: if you let $u=01$ and $v=10$, the automaton accepts any string over the alphabet ${u,v}$.

Answered by Brian M. Scott on November 12, 2021

Add your own answers!

Related Questions

Show that area are equals

0  Asked on December 16, 2020 by kevin-duran

   

Arg of $(1-isqrt{3})^6$. Did I do it right?

3  Asked on December 16, 2020 by cocacola

 

Coloring Two Faces of an Icosahedron

2  Asked on December 16, 2020 by user826216

     

A boundary condition

0  Asked on December 15, 2020 by lorenzo-andreaus

 

A complete bipartite graph is unique

1  Asked on December 15, 2020 by itsnotme

   

Behaviour of orthogonal matrices

2  Asked on December 15, 2020 by a9302c

       

Ask a Question

Get help from others!

© 2021 InsideDarkWeb.com. All rights reserved.