The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
21 views
The set of all strings over (a,b) having abab as substring is represented by what regular expressions?
asked in Theory of Computation by (17 points) | 21 views
0
do u want NFA or DFA?
0
I want the expression of dfa
0

(b+ a+b+)*a(a*+baa+ bb+a+)bab(a+b)* i got this :p

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
47,928 questions
52,333 answers
182,380 comments
67,805 users