Theory of Computation Regular Languages and Finite Automata

Given an alphabet  ∑, a regular language is a language which is not obtained from the basic languages by using which of the following operations? 

1
Union
2
Concatenation
3
Kleene* 
4
All of the above 

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters