New answers tagged regular-expressions
0
votes
How to find regular expression using ardent's rule for recursive expressions?
The correct equation system is the following:
$A=0A+1B$
$B=0B+1A+\epsilon$
Hence using Arden lemma, you obtain $B=0^*(1A+\epsilon)$
replacement in $A$ equation gives: $A=0A+10^*(1A+\epsilon)$
$A=0A+...
Top 50 recent answers are included
Related Tags
regular-expressions × 74fl.formal-languages × 32
automata-theory × 27
regular-language × 25
reference-request × 10
dfa × 8
cc.complexity-theory × 5
complexity-classes × 3
pl.programming-languages × 3
pspace × 3
ds.algorithms × 2
lower-bounds × 2
lg.learning × 2
grammars × 2
parsing × 2
nfa × 2
graph-theory × 1
np-hardness × 1
lo.logic × 1
approximation-algorithms × 1
optimization × 1
turing-machines × 1
communication-complexity × 1
tree × 1
algebra × 1