Recent questions tagged regular

0 votes

0 answers

1

Ullman (TOC) Edition 3 Exercise 4.2 Question 1 (Page No. 147)
Suppose $h$ is the homomorphism from the alphabet $\{0,1,2\}$ to the alphabet $\{a,b\}$ de fined by$:$ $h(0)=a;h(1)=ab,$ and $h(2)=ba.$ What is $h(0120)?$ What is $h(21120)?$ If $L$ is the language $L(01^{*}2),$ ... only the one string $ababa.$ What is $h^{-1}(L)?$ If $L$ is the language $L(a(ba)^{*}),$what is $h^{-1}(L)?$

asked Apr 4, 2019 in Theory of Computation by Lakshman Patel RJIT Veteran (58.6k points) | 12 views

0 votes

2 answers

2

regular ex
difference between a*(ba)* and (a+ba)* and how to represent both in finite automata?

asked Oct 6, 2018 in Theory of Computation by suneetha (447 points) | 66 views

0 votes

1 answer

3

State True or False: Classes of Grammar and respective automata
Consider the following statements:- I) Type-0 grammar generate exactly all language that can be accepted by a total Turing machine. II) Type-1 grammar generate exactly all languages that can be recognized by a linear bounded automata. ... a both are type 3 grammar but both represent same regular expression as a+ what is wrong in this??

asked Oct 2, 2017 in Theory of Computation by Shubhanshu Boss (18.3k points) | 403 views

+1 vote

1 answer

4

TOC - Doubt
Consider these statements: S1: If a language is infinite, it has to be non-Regular. S2: Let L be any language. $(\overline{L})^{*} \neq (\overline{L^{*}})$ (a) Both are True (c) S1 → True, S2 → False (b) Both are False (d) S1 → False, S2 → True

asked Sep 6, 2017 in Theory of Computation by Rishabh Gupta 2 Boss (17.7k points) | 172 views

0 votes

0 answers

5

context free grammer

asked Sep 4, 2017 in Theory of Computation by Sunil8860 (-113 points) | 39 views

+3 votes

2 answers

6

regular expression

asked Sep 4, 2017 in Theory of Computation by Sunil8860 (-113 points) | 106 views

+3 votes

3 answers

7

gate ,toc
a*b*b (a+ (ab)*)* b* shortest string generated by this RE?

asked Aug 21, 2016 in Theory of Computation by vishal messi (23 points) | 341 views

+2 votes

2 answers

8

Regular Expression time complexity
The equality of two regular expression is computed in? Give reasons also.. Constant Time polynomial time logarithmic Polynomial time Exponential time

asked Jul 8, 2016 in Theory of Computation by Kapil Veteran (50.9k points) | 451 views

+2 votes

1 answer

9

STATE TRUE OR FALSE
1) (L/a)a=L(the left side represents the concatenation of the languages L/a and {a}) 2) a(a/L)=L(again concatenation with {a},this time on the left,is intended) 3) (La)/a=L 4) a/(aL)=L

asked Jun 20, 2016 in Theory of Computation by Santhosh Devulapally (367 points) | 485 views

+1 vote

2 answers

10

construct a DFA to accept all strings which satisfy w(x)mod 5 =2 .

asked Jun 11, 2016 in Theory of Computation by Don't you worry Active (1.4k points) | 909 views

+1 vote

2 answers

11

Automata Regular expression
If r1 and r2 are 2 Regular Expression Such that r1 = (a+b)* r2 = (a*+b*+a*b*+b*a*) What are the different case's in which r1 = r2 ? Please Explain with an example

asked Jun 8, 2016 in Theory of Computation by shekhar chauhan Boss (45.4k points) | 345 views

0 votes

1 answer

12

Automata Grammar Regular Language
Regular grammars can only describe regular languages, why reverse is not true .What should be the most appropriate Reason ? Explain with in few Lines .If possible give an exp too.

asked Jun 7, 2016 in Theory of Computation by shekhar chauhan Boss (45.4k points) | 403 views

0 votes

3 answers

13

Finite Automata Regular Expression
Problem 1 : what is the Language associated with this regular expression ? a*b* write it down. Problem 2: Does either a subset or Super-set of a regular language is always a regular ? Problem 3 : What is the difference between a^n b^n and a*b* Explain with a example .

asked Jun 6, 2016 in Theory of Computation by shekhar chauhan Boss (45.4k points) | 309 views

+1 vote

1 answer

14

regular expression
regular expression for " set of all strings over {a,b} in which there are at least two occurrences of b between any two occurrences of a ".

asked May 31, 2016 by gate_forum Junior (867 points) | 862 views

+1 vote

1 answer

15

regular expression algebra
prove the identity: (a*ab + ba)* a* = (a + ab + ba)*

asked May 29, 2016 in Theory of Computation by gate_forum Junior (867 points) | 982 views

0 votes

1 answer

16

TOC
If a language L is not regular then homomorphism h(L) ? Regular Not regular Need not regular.

asked May 23, 2016 in Theory of Computation by ManojK Boss (38.6k points) | 97 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

Recent Posts

Recent Blog Comments