TechQA.

Question

L = {www| w belongs to {0,1}*} prove via pumping lemma

score 307 · Answer 1 · 2015-06-13 20:04:20

0

Answer

307

Views

L = {www| w belongs to {0,1}*} prove via pumping lemma

307 views Asked by hyeri At 13 June 2015 at 20:04

score 273 · Answer 2 · 2015-06-25 17:38:47

How to design a regex used for searching a pattern, rather than validating a pattern?

273 views Asked by JackWM At 25 June 2015 at 17:38

score 1300 · Answer 3 · 2016-12-14 02:45:50

Is $E_{LBA}$ a Turing recognizable language?

1.3k views Asked by rich At 14 December 2016 at 02:45

score 327 · Answer 4 · 2016-12-19 07:43:35

Bisimulation in state transition system

327 views Asked by Jamgreen At 19 December 2016 at 07:43

score 516 · Answer 5 · 2016-12-30 00:58:33

Lexical analyser : how to identify the end of a token

516 views Asked by Sierra At 30 December 2016 at 00:58

score 3787 · Answer 6 · 2017-01-04 16:54:23

Is ε terminal in context-free?

3.7k views Asked by alkokura49 At 04 January 2017 at 16:54

score 482 · Answer 7 · 2014-11-14 10:26:48

How can I build string matching tree from array of regex-es?

482 views Asked by kravemir At 14 November 2014 at 10:26

score 306 · Answer 8 · 2014-12-01 19:02:04

Simple explanation of PDA accept states?

306 views Asked by user3470131 At 01 December 2014 at 19:02

score 297 · Answer 9 · 2013-12-03 08:35:05

automata theorem: existance of a DFA

297 views Asked by OmriSoudry At 03 December 2013 at 08:35

score 420 · Answer 10 · 2017-08-28 11:57:22

Design DFA that checks wheter a boolean formula is true or false

420 views Asked by Stenli At 28 August 2017 at 11:57

TechQA.

List Question

L = {www| w belongs to {0,1}*} prove via pumping lemma

How to design a regex used for searching a pattern, rather than validating a pattern?

Is $E_{LBA}$ a Turing recognizable language?

Bisimulation in state transition system

Lexical analyser : how to identify the end of a token

Is ε terminal in context-free?

How can I build string matching tree from array of regex-es?

Simple explanation of PDA accept states?

automata theorem: existance of a DFA

Design DFA that checks wheter a boolean formula is true or false

Popular Questions

Popular Tags

Trending Questions