Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with regular-expressions
Search options not deleted
user 82
Questions about regular expressions, a formalism to describe regular languages.
34
votes
How to convert finite automata to regular expressions?
Brzozowski algebraic method
This is the same method as the one described in Raphael's answer, but from a point of view of a systematic algorithm, and then, indeed, the algorithm. It turns out to be ea …
- 131
112
votes
Accepted
How to convert finite automata to regular expressions?
There are several methods to do the conversion from finite automata to regular expressions. Here I will describe the one usually taught in school which is very visual. I believe it is the most used in …
CommunityBot
- 1
2
votes
Accepted
A regular expression for a given formal language
Try and build it step by step:
a language with an odd number of $a$'s: $a(aa)^*$;
between which there is an even number of $b$'s: $b^*a((bb)^*a(bb)^*a)^*b^*$;
and an arbitrary number of $x$'s: $(b+x …
- 9,548
28
votes
How to convert finite automata to regular expressions?
Transitive closure method
This method is easy to write in a form of an algorithm, but generates absurdly large regular expressions and is impractical if you do it by hand, mostly because this is too …
CommunityBot
- 1