RE
RE Workbench
Theory of Automata & Formal Languages
2024UCA1903
Kartik Gahlot
String Generator
Equivalence Checker
Regular Expression Input
RE =
✕
Quantifiers
*
zero or more
+
one or more
?
optional
Operators
|
union
(
open group
)
close group
ε
epsilon
Alphabet symbols
a
b
c
d
0
1
x
y
z
Max string length
4
Generate Strings
Clear
Accepted strings
—
// enter a regular expression and click Generate
Regular Expression #1
R1 =
✕
*
+
?
|
(
)
ε
a
b
c
0
1
x
Regular Expression #2
R2 =
✕
*
+
?
|
(
)
ε
a
b
c
0
1
x
Check Equivalence
Equivalence result
// enter two regular expressions and click Check Equivalence