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.

Recent questions tagged language

0 votes
0 answers 9 views
can we make DFA for a language where there is comparion between symbols but lanuage is finite a^nb^n;n<=3
asked Jun 8 in Theory of Computation promise 5 points 9 views
0 votes
1 answer 33 views
0 votes
1 answer 32 views
if it is square of a language. how n and m are unrelated?
asked Aug 5, 2019 in Theory of Computation Sathuri Bharath 83 points 32 views
0 votes
1 answer 31 views
Let L be regular language, and let Half(L) be: Half(L)={u∣uv∈L such that |u|=|v|} . Prove that if L is regular then Half(L) is regular too.
asked Jul 29, 2019 in Theory of Computation Arnabh Gangwar 23 points 31 views
To see more, click for the full list of questions or popular tags.