Sam Jones

41

Reputation

69 views

Registered User

Name	Sam Jones
Member for	1 year
Seen	Feb 18 at 15:04
Website	cs.le.ac.uk/people/sj175
Location	Leicester
Age	24

PhD student at the university of Leicester

stats recent reputation favorites

1

Questions

1

2

votes

1

answer

225

views

Given a PDA M such that L(M) is in DCFL construct a DPDA N such that L(N) = L(M)

formal-languages automata-theory computer-science computability-theory

jun 13 11 at 18:28 Sam Jones 41●6

2

Answers

Which Turing machines accept the language of trivial words in a finitely presented group?

Given a PDA M such that L(M) is in DCFL construct a DPDA N such that L(N) = L(M)

5

Votes

5

6

Tags

formal-languages× 2
it.information-theory
gr.group-theory
computer-science
computability-theory
automata-theory

6

Badges

● Teacher
● Supporter

● Scholar
● Autobiographer

● Editor
● Student