Recent activity by g.sreedurga / GATE Overflow for GATE CSE

4 answers

1

TIFR CSE 2014 | Part B | Question: 15
Consider the set $N^{*}$ of finite sequences of natural numbers with $x \leq_{p}y$ denoting that sequence $x$ is a prefix of sequence $y$. Then, which of the following is true? $N^{*}$ is uncountable. $\leq_{p}$ is a total order. Every non ... -empty subset of $N^{*}$ has a greatest lower bound. Every non-empty finite subset of $N^{*}$ has a least upper bound.

Consider the set $N^{*}$ of finite sequences of natural numbers with $x \leq_{p}y$ denoting that sequence $x$ is a prefix of sequence $y$. Then, which of the following is...

3.5k views

commented Dec 15, 2017

5 answers

2

TIFR CSE 2013 | Part B | Question: 4
A set $S$ together with partial order $\ll$ is called a well order if it has no infinite descending chains, i.e. there is no infinite sequence $x_1, x_2,\ldots$ of elements from $S$ such that $x_{i+1} \ll x_i$ and $x_{i+1} \neq x_i$ for all $i$. ... $2^{24}$ words. $W$ is not a partial order. $W$ is a partial order but not a well order. $W$ is a well order.

A set $S$ together with partial order $\ll$ is called a well order if it has no infinite descending chains, i.e. there is no infinite sequence $x_1, x_2,\ldots$ of elemen...

3.1k views

commented Dec 15, 2017

1 answer

3

Theory of computation
Design a TM that decides regular expression {w | w is a string not containing “101” as a substring }.

Design a TM that decides regular expression {w | w is a string not containing “101” as a substring }.

301 views

answered Nov 7, 2017

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