Search the web
Sign In
New User? Sign Up
comp-sci-theory · Computer Science Theory
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Show off your group to the world. Share a photo of your group with us.

Best of Y! Groups

   Check them out and nominate your group.
Having problems with message search? Fill out this form to ensure your group is one of the first to be migrated to the new message search system.

Messages

  Messages Help
Advanced
Messages 2185 - 2217 of 2737   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
2185
... Yes, it is an encoding. To encode a Turing Machine, first assume that the start state is always q_1 and the final state (and there can be only one final...
binarygrrl
Offline Send Email
Nov 1, 2005
12:58 pm
2186
It is trivial to prove that S={e|M_e accepts the string 00} is c.e. My proof is below. Is there some sort of step missing? Am I assuming the proof is unduly...
steescoth
Offline Send Email
Nov 1, 2005
8:28 pm
2187
Let L be a binary language. Prove that if L is accepted by some TM then it is accepted by a TM whose only tape symbols are 0,1, and B. ...
steescoth
Offline Send Email
Nov 1, 2005
10:40 pm
2188
Can a Turing machine ever write a blank symbol on its tape?...
steescoth
Offline Send Email
Nov 2, 2005
5:48 am
2189
... When I took the theory course it was assumed "no". I don't remember seeing a theorem which uses this assumption as a necessity, though. Best, Tony...
ptt_hatred
Offline Send Email
Nov 3, 2005
1:46 pm
2190
... Yes. See pages 324-325 of Hopcroft, Motwani, and Ullman[1] for an example of a Turing machine that does just this. If you don't have the above text, see...
Troy DeJongh
troy_dejongh
Offline Send Email
Nov 3, 2005
3:13 pm
2191
Hi, everyone. The minimal description of x, written d(x), is defined as by Sipser's book (p.215 ), "The shortest string <M,W> where TM M on input w halts with...
gridkim
Offline Send Email
Nov 4, 2005
12:08 am
2193
Hi gridkim, ... Remember that d(x) is of the form <N>w, where N is a TM that on input w, outputs x. So <M>d(x) looks like <M><N>w. Now by M's definition, it...
Kurt Van Etten
pnenp
Offline Send Email
Nov 7, 2005
4:05 am
2194
First of all, thanks for replying, binarygrrl and pnenp. That was very helpful. I am thinking about majoring in A.I area. Before I get down to that area, I am...
gridkim
Offline Send Email
Nov 8, 2005
7:11 am
2195
Enderton's book is helpful. Cori and Lascar have a two-volume set on mathematical logic. Also, Professor Monk at University of COlorado at Boulder keeps a nice...
everett piper
toolradiohead2
Online Now Send Email
Nov 8, 2005
7:31 am
2196
Hi Kim, For an introduction to logic with a strong computer science slant, I would recommend "Computability and Logic" by Boolos and Jeffrey. For a more...
Kurt Van Etten
pnenp
Offline Send Email
Nov 9, 2005
10:35 am
2197
I am interested in the algebraic approach to the theory of computation, developing the theory of automata and formal languages in terms of abstract algebra. I...
Mark Arvid Johnson
maji1967
Offline Send Email
Nov 12, 2005
4:23 am
2198
... Abraham Ginzburg: Algebraic Theory of Automata -- "a totalitarian ideology that hates freedom, rejects tolerance, and despises all dissent." --- Bush...
Lieven Marchand
lievenmarcha...
Offline Send Email
Nov 12, 2005
9:08 am
2200
Hi Mark, I'm not personally familiar with this text, but "Finite Automata" by Mark V. Lawson looks like it might serve your needs. It starts out with a more...
Kurt Van Etten
pnenp
Offline Send Email
Nov 12, 2005
10:32 pm
2201
Hi, I m happy to introduce myself as Krishna,from bangalore.Joined an SW Co. here out of college. I m very much intersted in Theory of Computer Science. My...
my_inbox_waits
Offline Send Email
Nov 15, 2005
11:36 am
2202
Hi everyone.. I need help about graph theory ( network problems ,Critical points edges) .. I have below problem . Does anyone know any existence algorithms...
acaralihaydar
Offline Send Email
Nov 15, 2005
10:52 pm
2203
it is easy if you think about it .. suppose you've got your graph like 0 1 2 3 4 5 6 ...... n 0 1 x 2 x x 3 x 4 n That's most...
Nicolás Vinacur
gring0ar
Offline Send Email
Nov 16, 2005
2:09 am
2204
I'm sorry I think I said it wrong, I've just reread the problem.. for the critc link is was wondering, you could make something like .. for each subgraph...
Nicolás Vinacur
gring0ar
Offline Send Email
Nov 16, 2005
9:54 am
2205
The vertices of graph can be divided into two partitions - blocks and cut-vertices. These cut-vertices refer to the critical nodes that you mentioned. A...
Dhananjay Kulkarni
kulkarni_dh
Offline Send Email
Nov 16, 2005
10:46 am
2206
Hi, I am a recent graduate of Dartmouth College and am working with young alumni from around the country to promote a new non-profit, online database of...
noteboom7
Offline Send Email
Nov 16, 2005
1:47 pm
2207
Hi Peter, The database for thesis papers is a nice idea, but I'm not sure why you restrict access to the database if your aim is to expose this research to a...
Kurt Van Etten
pnenp
Offline Send Email
Nov 17, 2005
6:52 pm
2208
Hi Kurt, Anyone can access the database. If they don't have an email domain associated with an academic institution, they can ask for an individual...
noteboom7
Offline Send Email
Nov 18, 2005
5:35 pm
2209
Thanks for the recommendation, but Ginzburg is at a much higher level than I am looking for, and is hard to get a hold of besides....
Mark Arvid Johnson
maji1967
Offline Send Email
Nov 19, 2005
2:49 pm
2210
Kurt, Harlan Mills, in _Software Productivity_, mentions that formal languages are fundamentally algebraic, despite widely different notations due to ...
Mark Arvid Johnson
maji1967
Offline Send Email
Nov 19, 2005
4:03 pm
2211
Hi, Mark. I think that you might find the books listed below to nicely suit your needs. Based on the table of contents of the book you cited, I'm thinking...
Troy DeJongh
troy_dejongh
Offline Send Email
Nov 19, 2005
4:52 pm
2212
Hi Peter, Okay, I retract my comment about survey papers. (By the way, that wasn't meant to be pejorative; a well written survey paper can be very valuable...
Kurt Van Etten
pnenp
Offline Send Email
Nov 19, 2005
5:02 pm
2213
Hi Mark, I don't know very much about this area, but there should be others on the list who might be able to add to the discussion. The impression I have...
Kurt Van Etten
pnenp
Offline Send Email
Nov 19, 2005
6:37 pm
2215
Given: a set of positive integers {x1,x2...xn} and another positive interget k. Query: Is there a set of indices I, which is a subset of {1,2....n}, where...
together_2005_01
together_200...
Offline Send Email
Nov 21, 2005
3:11 am
2216
Dear members, I am a Research Scholar (Computer Science) in T.I.F.R.,India.I am doing my PhD(1st year)in Graph Algorithm.Can anyone of you suggest me about...
aj_thak
Offline Send Email
Nov 21, 2005
10:29 am
2217
Hi Mark, Well, I think I need to retract myself, yet again. Here's an interesting link I came across, for a workshop to be held at Berkeley next summer: ...
Kurt Van Etten
pnenp
Offline Send Email
Nov 21, 2005
6:50 pm
Messages 2185 - 2217 of 2737   Oldest  |  < Older  |  Newer >  |  Newest
Advanced
Add to My Yahoo!      XML What's This?

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help