The Gateway to Computer Science Excellence
0 votes
16 views

Write regular expressions for the following languages$:$

  1. The set of strings over alphabet $\{a,b,c\}$ containing at least one $a$ and at-least one $b.$
  2. The set of strings of $0's$ and $1's$ whose tenth symbol from the right end is $1.$
  3. The set of strings of $0's$ and $1's$ with at most one pair of consecutive $1's.$
in Theory of Computation by Veteran (59.1k points)
edited by | 16 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,336 answers
198,445 comments
105,202 users