search
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
7 views
if language is finite then dfa possible irrespective of comparison between symbols  exist or not.is it true??
in Theory of Computation 5 points 7 views
0
Yes, because the comparison doesn't matter.

Suppose i don't know how to multiply, you give me a table of 12 and now ask me to repeat it, I can do that even though i don't know multiplication, because I don't need to actually multiply i have to tell you whatever you already told me.

Similarly if have a finite language, the dfa can recognize all the words in the language because you already told it what the words are.

Please log in or register to answer this question.

...