Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Theory of computation
A_i_$_h
asked
in
Theory of Computation
Jul 11, 2017
566
views
1
vote
1
vote
if x=10 and y= 1010
x is a proper prefix of y
if x =11 and y = 101101
is x a proper prefix of y?? or is it only a substring
proper prefixes must contain from the zeroth element and not just any part in between?
A_i_$_h
asked
in
Theory of Computation
Jul 11, 2017
by
A_i_$_h
566
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
0
votes
0
votes
Best answer
If y=101101
then its proper prefixes are
λ,1,10,101,1011,10110
x is a prefix of y if xz=y and x is not equal to y.
No, x is not a proper prefix of y.
It is a substring.
substring is any consecutive symbols taken from a string.
mdaamirk
answered
Jul 11, 2017
selected
Jul 12, 2017
by
A_i_$_h
by
mdaamirk
comment
Follow
share this
2 Comments
by
A_i_$_h
commented
Jul 12, 2017
reply
Follow
share this
thank you :)
0
0
by
mdaamirk
commented
Jul 12, 2017
reply
Follow
share this
welcome :)
0
0
Please
log in
or
register
to add a comment.
0
votes
0
votes
No its not proper prefix of y
Deepak Raj 1
answered
Jul 13, 2017
by
Deepak Raj 1
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
MunchyMoo
asked
in
Theory of Computation
Dec 3, 2023
172
views
Gateoverflow Test Series Theory of computation 2024
Consider the following language definition: L={⟨M⟩ ∣ M is a DFA and M accepts some string of the form ww^R for some w∈Σ∗} L is Regular Context-free but not regular Recursive but not context-free Recursively enumerable but not ... L and L2. For L2 through rice theorem, do we say it's not trivial and hence undecidable and not recursive?
MunchyMoo
asked
in
Theory of Computation
Dec 3, 2023
by
MunchyMoo
172
views
0
votes
0
votes
0
answers
2
baofbuiafbi
asked
in
Theory of Computation
Nov 14, 2023
156
views
Michael Sipster Theory of Computation
Prove the language L={(G,H)|G is a CFG, H is a DFA, and L(G)∩L(H)=∅} is undecidable.
baofbuiafbi
asked
in
Theory of Computation
Nov 14, 2023
by
baofbuiafbi
156
views
theory-of-computation
number-of-dfa
michael-sipser
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
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:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy