Log In
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.
0 votes
can we make DFA for a language where there is comparion between symbols but lanuage is finite a^nb^n;n<=3
in Theory of Computation 5 points 9 views
Yes, every finite language is regular.

Please log in or register to answer this question.