Question

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

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

230

Views

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

Published on 13 June 2015 at 20:04

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

220

Views

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

Published on 25 June 2015 at 17:38

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

1.2k

Views

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

Published on 14 December 2016 at 02:45

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

249

Views

Bisimulation in state transition system

Published on 19 December 2016 at 07:43

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

440

Views

Lexical analyser : how to identify the end of a token

Published on 30 December 2016 at 00:58

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

3.6k

Views

Is ε terminal in context-free?

Published on 04 January 2017 at 16:54

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

404

Views

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

Published on 14 November 2014 at 10:26

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

229

Views

Simple explanation of PDA accept states?

Published on 01 December 2014 at 19:02

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

208

Views

automata theorem: existance of a DFA

Published on 03 December 2013 at 08:35

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

333

Views

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

Published on 28 August 2017 at 11:57

score 17.7k · Answer 11 · 2017-08-29 10:58:57

17.7k

Views

DFA that contains 1101 as a substring

Published on 29 August 2017 at 10:58

score 254 · Answer 12 · 2017-09-04 19:02:10

254

Views

Number of Turing Machines?

Published on 04 September 2017 at 19:02

score 638 · Answer 13 · 2017-09-03 09:38:39

638

Views

1 or 2 right hand side variable in Context free language

Published on 03 September 2017 at 09:38

score 147 · Answer 14 · 2017-09-14 12:26:23

147

Views

I'm trying to solve DFA

Published on 14 September 2017 at 12:26

score 170 · Answer 15 · 2017-09-15 08:36:21

170

Views

Automata on ruby

Published on 15 September 2017 at 08:36

score 851 · Answer 16 · 2011-02-03 16:49:28

851

Views

How to Design an acceptor for integers in a programming language C

Published on 03 February 2011 at 16:49

score 513 · Answer 17 · 2011-02-08 21:34:05

513

Views

What regular language intersects with 10 gives 1n0n

Published on 08 February 2011 at 21:34

score 474 · Answer 18 · 2011-02-03 10:52:51

474

Views

Difference between Transducer and NFA

Published on 03 February 2011 at 10:52

score 1.1k · Answer 19 · 2011-02-24 14:39:05

1.1k

Views

Context free grammar for this language

Published on 24 February 2011 at 14:39

score 18.8k · Answer 20 · 2013-08-24 22:44:40

18.8k

Views

What exactly is the 'pumping length' in the Pumping lemma?

Published on 24 August 2013 at 22:44

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

DFA that contains 1101 as a substring

Number of Turing Machines?

1 or 2 right hand side variable in Context free language

I'm trying to solve DFA

Automata on ruby

How to Design an acceptor for integers in a programming language C

What regular language intersects with 10 gives 1n0n

Difference between Transducer and NFA

Context free grammar for this language

What exactly is the 'pumping length' in the Pumping lemma?

Trending Questions

Popular # Hahtags

Popular Questions