Register

Recent questions tagged regular-language

1.9k
views
3 answers
1 votes
UGC NET CSE | August 2016 | Part 3 | Question: 55
Given the following two languages :$L_{1} = {uww^{R} ν | u, v, w \in (a, b)^{+}}$L_{2} = {uww^{R} ν | u, ν, w \in (a, b)^{+} , |u| \geq ... .Both $L_{1}$ and $L_{2}$ are regular languages.Both $L_{1}$ and $L_{2}$ are not regular languages.
User Avatar
748
views
3 answers
1 votes
Checking regularity of a given language.
$L = \left \{ a^nb^mc^p : n+m+p > 5 \right \}.$
User Avatar
828
views
1 answers
1 votes
Peterlinz- find out if lang is regular or not
L= { uwwRv : u,v,w are from {a,b}+ } is L regular ?L' = { wwRv : u,v,w are from {a,b}+ } is L' regular ?
User Avatar
7.6k
views
8 answers
3 votes
UGC NET CSE | June 2016 | Part 3 | Question: 55
Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation $R_M$ defined by M as ... that are reachable from the start state. $R_M$ has ___ equivalence classes.2456
User Avatar
2.6k
views
1 answers
1 votes
UGC NET CSE | June 2016 | Part 3 | Question: 22
The symmetric differences of two sets $S_1$ and $S_2$ ... difference and norThe family of regular languages are not closed under both symmetric difference and nor
User Avatar
8.1k
views
1 answers
6 votes
Regular Language
Alphabet : {a, b}Language : Set of all strings which start and end with same symbolDoubt : Can $\epsilon$ be considered as part of the language ?Edit: I ... ab" or even between a and b.If you disagree with me please give some explanation.
User Avatar
296
views
1 answers
3 votes
TOC
ambnap what is the complement oif this Language?Is that complement a regular language?
User Avatar
672
views
4 answers
4 votes
TOC_regular
is this a regular Language?L=(a+b)* | where No of (a)-no of(b) <=10
User Avatar
484
views
1 answers
0 votes
TOC regular language
Is regular languages closed under1)Infinite Union2)Infinite Intersection
User Avatar
395
views
2 answers
1 votes
Toc -regular
If L is a regular Language and R is any language such that L+R is regular,then R isa)Must be regularb)May or may not be regularc)Must be non regular languaged)Must be CFL
User Avatar
2.0k
views
2 answers
2 votes
Toc -regular
Which of the following statements are true?1)The union of 2 non regular languages is non regular.2)The intersection of 2 non regular languages is non regular.a) 1 onlyb) 2 onlyc)bothd)none
User Avatar
955
views
1 answers
3 votes
Toc - Regular
Consider the language L={0p |p is a prime number} over the alphabet {0} .State whether the following statement is true or false?L is not regular but L* is regular?The cardinality of set (L*)' is 1.
User Avatar
803
views
1 answers
1 votes
TOC-regular languages
L1 = {apbq | p+q>=106} p,q, can only belong to set N.L1 Regular or not?Complement of L1 is definitely regular,so this should be regular,but it is confusing?
User Avatar
644
views
4 answers
4 votes
TOC
L = {ambn | m+n is even or odd}, L is regular or not???
User Avatar
865
views
1 answers
3 votes
Closure Property of Regular Language (Quotient)
Can anyone explain me How Regular languages closed under left or right quotient.
User Avatar
5.1k
views
3 answers
1 votes
UGC NET CSE | December 2014 | Part 3 | Question: 23
Given two languages :$L_{1}=\left\{(ab)^{n} a^{k} | n > k, k \geq 0\right\}$ ... is regular and $L_{2}$ is regular.$L_{1}$ is not regular and $L_{2}$ is not regular.
User Avatar
3.5k
views
1 answers
3 votes
UGC NET CSE | December 2013 | Part 2 | Question: 28
Given the following statements:$S_1$: If $L$ is a regular language then the language $\{uv \mid u \in L, v \in L^R\}$ is also regular.$S_2$ ... is correct$S_1$ is correct and $S_2$ is not correct$S_1$ is correct and $S_2$ is correct
User Avatar
957
views
1 answers
1 votes
UGC NET CSE | September 2013 | Part 3 | Question: 16
Assume, $L$ is regular language. Let statements $S_1$ and $S_2$ ... $S_1$ and $S_2$ are not correct$S_1$ is not correct and $S_2$ is correct
User Avatar
1.9k
views
1 answers
0 votes
UGC NET CSE | September 2013 | Part 2 | Question: 15
Consider the following two languages:$L_1 =\{a^n b^l a^k \mid n+l+k > 5\}$ ... languageBoth $L_1$ and $L_2$ are not regular language$L_1$ is not regular language and $L_2$ is regular language
User Avatar
898
views
1 answers
2 votes
Regular language
Is the following language a regular language.:L={ (a^p)*|p is a prime no} ....?If so, then how many min no of states in NFA that accepts a lang L?
User Avatar
539
views
1 answers
0 votes
regular grammar
If a grammar G is not regular(i.e. neither left linear nor right linear) but G can be transformed into regular grammar G'(i.e. transformed into left or right linear ) ,then can L(G) be regular ?
User Avatar
12.0k
views
1 answers
6 votes
Homomorphism
What exactly Homomorphism of a language is? What is the need of it? .. And how is it closed under regular languages?
User Avatar
2.2k
views
1 answers
3 votes
Regular language
The following grammarS$\rightarrow$SS|a|∈can generate a*... which itself is a regular language but the grammar is neither right linear nor left linear... And ... are always left or right linear.. Why is there such contradiction....?
User Avatar
1.9k
views
1 answers
3 votes
UGC NET CSE | June 2016 | Part 3 | Question: 24
Consider the following two languages:$L_1=\{0^i1^j \mid ged (i,j)=1 \}$L_2$ is any subset of 0*Which of the following is correct?$ ... $L_1$ and $L_2*$ are regular languagesBoth $L_1$ and $L_2*$ are not regular languages
User Avatar
974
views
2 answers
0 votes
Finite Automate and Regular Sets
I have a doubt in this that according to me the answer should be 6 as 5 states for modulo 5 + 1 dead state in starting as according to ques the string is ... is 7 states i m really confused how ?? Please help me what is its real answer
User Avatar
7.8k
views
1 answers
2 votes
Regularity of the strings
Which of the following is/are not regularA)strings of 0's whose length is a perfect squareB)set of all palindromes made up of 0's & 1'sC)Strings of 0's whose length is prime numberD)all the above
User Avatar
3.2k
views
2 answers
10 votes
ISRO2015-43
Let $R_1$ and $R_2$ be regular sets defined over the alphabet, then$ R_1 \cap R_2$ is not regular$R_1 \cup R_2$ is not regular$\Sigma^* - R_1$ is regular$R_1^*$ is not regular
User Avatar
757
views
1 answers
0 votes
Language Toc
Why this is not a regular Language?a^i b^j^2 where i,j >=1Here , there is nothing to store or nothing to compare against with any thing i and j are independent of each ... t we say any no of a's followed by any no of b's. and create a FA.
User Avatar
3.2k
views
1 answers
3 votes
Can a Non-Regular Grammar Produce's Regular Language ?.Give an Exp.
User Avatar
987
views
1 answers
0 votes
Automata Grammar Language
Write a Grammar which is a not type -3 Grammar, from the Language L over alphabets {a ,b} which contains ab as a Sub-string. Explain the procedure with Example .
User Avatar
Page: