Recent questions tagged regular-languages

0 votes

1 answer

1

self made doubt
How to know that the language needs 1 stack or more than one stack in order to know about it is regular, context-free or not. example L1={$a^i b^j c^k│i<j<k$} L2={$a^i b^j c^k│i<j \ or \ k<j$} L3={$a^i b^j c^k│i<j \ and \ k<j$}

asked Jun 11 in Theory of Computation by Divyanshum29 (123 points) | 45 views

+1 vote

0 answers

2

Theory of computation

asked Jun 6 in Theory of Computation by Prince Sindhiya Junior (699 points) | 31 views

+1 vote

0 answers

3

Theory of computation

asked Jun 6 in Theory of Computation by Prince Sindhiya Junior (699 points) | 18 views

+1 vote

0 answers

4

Introduction to Automata Theory- Properties of regular Languages - Q 4.2.10

asked Jun 6 in Theory of Computation by Savvy (17 points) | 29 views

0 votes

2 answers

5

Toc regular language

asked Jun 6 in Theory of Computation by Shivani gaikawad (181 points) | 62 views

0 votes

1 answer

6

Toc regular language

asked Jun 6 in Theory of Computation by Shivani gaikawad (181 points) | 23 views

0 votes

1 answer

7

Language Regular or not
Is it regular? $\left \{ \left ( 0^{n} \right )^{m}|n<m,n,m\geq 1 \right \}$

asked May 24 in Theory of Computation by srestha Veteran (86.8k points) | 111 views

+1 vote

1 answer

8

peter linz
given regular language L = {$a^n$b:n≥0} $L^2$ - L = $L^2$ since there's no string in $L^2$ which is in L. Am i correct ?

asked May 5 in Theory of Computation by Ananya Jaiswal 1 Active (1.6k points) | 73 views

0 votes

1 answer

9

Peter Linz Chapter 4.3 Exercise Q.20
I don't think it will be regular . Had the language been uwwRv the expression could have been (a+b)*(aa+bb)(a+b)* as there is no restriction on w. Is it correct? and if it isn't regular, is it a CFL?

asked May 4 in Theory of Computation by Subham Nagar Junior (539 points) | 65 views

0 votes

1 answer

10

Peter Linz Chapter 4
L = {a^n: n ≥ 2, is a prime number}. This is not a regular language. What about L*? Is it regular? Please explain.

asked May 4 in Theory of Computation by Subham Nagar Junior (539 points) | 54 views

0 votes

2 answers

11

TOC regular language
L={a^n b^n :n>=1} and R = (a+b)^* L union R is going to be regular or not regular plzz give reason L is not regular if N leads to infinity then how it can be regular ..........

asked May 1 in Theory of Computation by sanju77767 (151 points) | 64 views

0 votes

1 answer

12

regular grammar
What will be regular grammar for given regular expression $r=(ab^*+b)^*ab$

asked Mar 27 in Theory of Computation by saurabh rai Boss (12.3k points) | 51 views

0 votes

2 answers

13

TOC Problem

asked Mar 23 in Theory of Computation by pankaj_vir Loyal (8.5k points) | 82 views

0 votes

1 answer

14

Testbook_TOC

asked Mar 23 in Theory of Computation by pankaj_vir Loyal (8.5k points) | 67 views

0 votes

2 answers

15

Peter Linz Exercise 4.3.11
Show that the language $L =$$\left \{ a^{n!} : n\geq 1 \right \}$ is not regular using pumping lemma

asked Mar 20 in Theory of Computation by Mk Utkarsh Boss (12.6k points) | 122 views

+1 vote

2 answers

16

True / False (Regular Languages)
$L_{1} L_{2}$ is regular if and only if $L_{1}$ and $L_{2}$ both are regular If $L_{1}\cup L_{2}$ is regular and $L_{2}$ is finite then $L_{1}$ is regular If $L_{1}\cap L_{2}$ is regular then $L_{2}$ and $L_{1}$ may or may not be regular If $L_{1}$$L_{2}$ is regular then $L_{2}$ and $L_{1}$ are regular

asked Mar 17 in Theory of Computation by Mk Utkarsh Boss (12.6k points) | 71 views

0 votes

2 answers

17

Peter linz Exercise 3.1 Question 16.3
Give regular expression for the following language on $\sum = \left \{ a,b,c \right \}$ All strings that contain at least one occurrence of each symbol in $\sum$

asked Mar 14 in Theory of Computation by Mk Utkarsh Boss (12.6k points) | 74 views

+1 vote

1 answer

18

Peter Linz Exercise 3.1 Question 9
Give a regular expression for $L^{R}$ L = $(a+bc)^{*}(c+\phi)$

asked Mar 14 in Theory of Computation by Mk Utkarsh Boss (12.6k points) | 56 views

+1 vote

1 answer

19

Automata
If $L1$ is regular language and $L2$ is unknown language then what can we say about $L1-L2$. Will it be regular or not? I think it will be regular because even if $L2$ is not regular then still (Regular - not Regular) will result in Regular, according to the properties of set ... from The given set will not change the set. I want to know if I am right and if I am not then what's the error?

asked Mar 10 in Theory of Computation by hrcule (135 points) | 55 views

+1 vote

0 answers

20

Regular Expression
What is the regular expression of $L = \{ s \in L$ $i$ = no of $1$ in string $s$ $j$ = no of $0$ in string $s$ $i+j$ is odd $\}$ ???

asked Mar 4 in Theory of Computation by Dharmesh Gusai (19 points) | 82 views

0 votes

1 answer

21

Finding whether given languages are regular or context free

asked Mar 2 in Theory of Computation by GateAspirant999 Active (2.5k points) | 52 views

+1 vote

1 answer

22

Language of left, right, top and down steps

asked Mar 2 in Theory of Computation by GateAspirant999 Active (2.5k points) | 33 views

+2 votes

1 answer

23

Regular language- Prefix
Given FSA for language L, how to find FSA that accepts all prefixes of L? Acc to below mentioned link- "We can construct a DFA to decide Prefix(L) by taking the DFA for L and marking all states from which an accept state is reachable ... states from which an accept state is reachable as accept states, then eventually all states would turn to final states.Am I right?

asked Mar 2 in Theory of Computation by Mamta Satywali Active (2.2k points) | 72 views

+1 vote

2 answers

24

Regular Expressions
L1={anbm:n>=3,m<=4} Find complement of L1

asked Feb 14 in Theory of Computation by Ahsanul Hoque (163 points) | 94 views

+2 votes

1 answer

25

Regular Language
Let $L\mid$ be a regular language and $L_1| = \{x|\mid\text{there exist y}\mid \text{so that xy} \in L| \text{ and} \mid x \mid = 2 \mid y\mid \mid \}$ $L_2| = \{x|\mid\text{there exist y}\mid \text{so that yx} \in L| \text{ and} \mid x ... is regular but $L_2|$ is not. $L_2|$ is regular but $L_1|$ is not. Both $L_1|$ and $L_2|$ are regular. Both $L_1|$ and $L_2|$ are not regular.

asked Feb 2 in Theory of Computation by vijay_jr Active (1.1k points) | 82 views

+1 vote

0 answers

26

#Practise Class of Languages
$xwxw^r |\ w,x \in (a,b)^*$ $wxw^{r}x |\ w,x \in (a,b)^*$

asked Jan 31 in Theory of Computation by Anjan Active (1.7k points) | 34 views

0 votes

1 answer

27

Regular Languages
Language {w | ww=www} is regular. How and what is this language?

asked Jan 31 in Theory of Computation by gauravkc Loyal (5.4k points) | 46 views

+1 vote

0 answers

28

Regular - Context Free?
Let L be a given context-free language over the alphabet {a, b}. Construct L1, L2 as follows. Let L1 = L − {xyx | x, y ∈ {a, b}∗}, and L2 = L·L. Then, (A) Both L1 and L2 are regular. B) Both L1 and L2 are context free but not necessarily regular. (C) L1 is regular and L2 is context free. (D) L1 and L2 both may not be context free

asked Jan 30 in Theory of Computation by Tuhin Dutta Loyal (7.9k points) | 67 views

+2 votes

1 answer

29

Made easy test
(a^n)^m b^n where n>=0 and m>1 is a) regular b) cfl c) csl d) none

asked Jan 29 in Theory of Computation by ♥_Less Junior (987 points) | 79 views

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

Recent questions tagged regular-languages

Recent Posts

Recent Blog Comments