in Algorithms
35 views
0 votes
0 votes

write a regular expressions for each of the following languages over the alphabet {0, 1};

  1. the set of all strings containing 101 as a substring.

Instructions: construct a finite automata equivalent to the following regular expressions:

  1. 10+ (0+11) 0*1
  2. (11+0)* (00+1)*
  3. [ 00+11+(01+10)  (00 + 11)* (01 + 10)*
in Algorithms
by
5 points
35 views

Please log in or register to answer this question.

Ask
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.