CMI2013-A-04

go_editor asked in Theory of Computation May 23, 2016

369 views

1 vote

Consider the set of all words over the alphabet $\{x, y, z\}$ where the number of $y$’s is not divisible by 2 or 7 and no $x$ appears after a $z$. This language is:

regular
not known to be regular
context-free but not regular
recursively enumerable but not context-free

cmi2013
theory-of-computation
identify-class-language

go_editor asked in Theory of Computation May 23, 2016

by go_editor

369 views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

2 Answers

0 votes

It will be regular

It consists of 14 states where 1st state consists of x or z

srestha answered May 23, 2016

by srestha

0 Comments

Please log in or register to add a comment.

0 votes

Answer:

soujanyareddy13 answered May 7, 2021

by soujanyareddy13

0 Comments

Please log in or register to add a comment.

← Previous Next →

← Previous in category Next in category →

Related questions

7 votes

1 answer

go_editor asked in Algorithms May 23, 2016

913 views

CMI2013-B-04
You are given two sorted lists of integers of size $m$ and $n$. Describe a divide and conquer algorithm for computing the $k$-th smallest element in the union of the two lists in time $O(\log m + \log n)$.

go_editor asked in Algorithms May 23, 2016

by go_editor

913 views

cmi2013
algorithms
sorting
divide-and-conquer
descriptive

2 votes

2 answers

go_editor asked in Theory of Computation May 23, 2016

453 views

CMI2013-B-01
For a binary string $x = a_0a_1 \dots a_{n−1}$ define $val(x)$ to be the value of $x$ interpreted as a binary number, where $a_0$ is the most significant bit. More formally, $val(x)$ is given by $\Sigma_{0 \leq i < n} 2^{n-1-i} .a_i$ Design a finite automaton that accepts exactly the set of binary strings $x$ such that $val(x)$ is divisible by either 4 or 5.

go_editor asked in Theory of Computation May 23, 2016

by go_editor

453 views

cmi2013
descriptive
theory-of-computation
finite-automata

6 votes

3 answers

go_editor asked in Algorithms May 23, 2016

1,354 views

CMI2013-A-10
The below question is based on following program: procedure mystery (A : array [1..100] of int) int i,j,position,tmp; begin for j := 1 to 100 do position := j; for i := j to 100 do if (A[i] > A[position]) then position := i; endfor tmp := A[j]; ... endfor end The number of times the test $A[i] > A[\text{position}]$ is executed is: $100$ $5050$ $10000$ Depends on contents of $A$

go_editor asked in Algorithms May 23, 2016

by go_editor

1.4k views

cmi2013
algorithms
time-complexity

9 votes

3 answers

go_editor asked in Algorithms May 23, 2016

1,112 views

CMI2013-A-09
The below question is based on the following program. procedure mystery (A : array [1..100] of int) int i,j,position,tmp; begin for j := 1 to 100 do position := j; for i := j to 100 do if (A[i] > A[position]) then ... A[position] := tmp; endfor end When the procedure terminates, the array A has been: Reversed Left unaltered Sorted in descending order Sorted in ascending order

go_editor asked in Algorithms May 23, 2016

by go_editor

1.1k views

cmi2013
algorithms
identify-function

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Subjects

All categories
General Aptitude (3.5k)
Engineering Mathematics (10.4k)
Digital Logic (3.6k)
Programming and DS (6.2k)
Algorithms (4.8k)
Theory of Computation (6.9k)
Compiler Design (2.5k)
Operating System (5.2k)
Databases (4.8k)
CO and Architecture (4.0k)
Computer Networks (4.9k)
Artificial Intelligence (79)
Machine Learning (48)
Data Mining and Warehousing (25)
Non GATE (1.4k)
Others (2.7k)
Admissions (684)
Exam Queries (1.6k)
Tier 1 Placement Questions (17)
Job Queries (80)
Projects (11)
Unknown Category (870)

64.3k questions

77.9k answers

244k comments

80.0k users

Recent Blog Comments

category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

CMI2013-A-04

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

2 Answers

0 Comments

Please log in or register to add a comment.

0 Comments

Please log in or register to add a comment.

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Recent Posts

Subjects

Recent Blog Comments