The Gateway to Computer Science Excellence
0 votes
19 views

Write regular expressions for the following languages$:$

  1. The set of all strings of $0's$ and $1's$ such that every pair of adjacent $0's$ appears before any pair of adjacent $1's.$
  2. The set of strings of $0's$ and $1's$ whose number of $0's$ is divisible by five.
in Theory of Computation by Veteran (59.5k points)
edited by | 19 views

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
50,737 questions
57,405 answers
198,627 comments
105,467 users