The Gateway to Computer Science Excellence
0 votes
51 views
Give an unambiguous grammar that generates the set of all regular expressions on $Σ =$ {$a,b$}.
in Theory of Computation by | 51 views

Please log in or register to answer this question.

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
52,345 questions
60,487 answers
201,821 comments
95,293 users