Skip to main content

All Questions

Filter by
Sorted by
Tagged with
146 votes
5 answers
210k views

How to convert finite automata to regular expressions?

Converting regular expressions into (minimal) NFA that accept the same language is easy with standard algorithms, e.g. Thompson's algorithm. The other direction seems to be more tedious, though, and ...
Raphael's user avatar
  • 73.2k