Question

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

score 255 · Answer 1 · 2024-10-12 18:01:32

255

Views

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

Published on 12 October 2024 at 18:01

score 244 · Answer 2 · 2024-10-16 14:29:01

244

Views

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

Published on 16 October 2024 at 14:29

score 1.2k · Answer 3 · 2024-10-16 19:07:43

1.2k

Views

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

Published on 16 October 2024 at 19:07

score 274 · Answer 4 · 2024-10-19 16:37:12

274

Views

Bisimulation in state transition system

Published on 19 October 2024 at 16:37

score 477 · Answer 5 · 2024-10-16 19:01:32

477

Views

Lexical analyser : how to identify the end of a token

Published on 16 October 2024 at 19:01

score 3.7k · Answer 6 · 2024-10-16 18:38:53

3.7k

Views

Is ε terminal in context-free?

Published on 16 October 2024 at 18:38

score 430 · Answer 7 · 2024-10-16 18:51:40

430

Views

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

Published on 16 October 2024 at 18:51

score 251 · Answer 8 · 2024-10-17 19:52:50

251

Views

Simple explanation of PDA accept states?

Published on 17 October 2024 at 19:52

score 245 · Answer 9 · 2024-10-18 19:16:52

245

Views

automata theorem: existance of a DFA

Published on 18 October 2024 at 19:16

score 355 · Answer 10 · 2024-10-16 14:57:45

355

Views

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

Published on 16 October 2024 at 14:57

score 17.7k · Answer 11 · 2024-10-12 01:19:44

17.7k

Views

DFA that contains 1101 as a substring

Published on 12 October 2024 at 01:19

score 263 · Answer 12 · 2024-10-15 10:31:00

263

Views

Number of Turing Machines?

Published on 15 October 2024 at 10:31

score 664 · Answer 13 · 2024-10-12 15:17:56

664

Views

1 or 2 right hand side variable in Context free language

Published on 12 October 2024 at 15:17

score 174 · Answer 14 · 2024-10-13 20:55:35

174

Views

I'm trying to solve DFA

Published on 13 October 2024 at 20:55

score 182 · Answer 15 · 2024-10-16 19:00:20

182

Views

Automata on ruby

Published on 16 October 2024 at 19:00

score 865 · Answer 16 · 2024-10-15 10:43:58

865

Views

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

Published on 15 October 2024 at 10:43

score 534 · Answer 17 · 2024-10-16 19:00:12

534

Views

What regular language intersects with 10 gives 1n0n

Published on 16 October 2024 at 19:00

score 497 · Answer 18 · 2024-10-17 00:28:54

497

Views

Difference between Transducer and NFA

Published on 17 October 2024 at 00:28

score 1.2k · Answer 19 · 2024-10-15 10:13:50

1.2k

Views

Context free grammar for this language

Published on 15 October 2024 at 10:13

score 18.8k · Answer 20 · 2024-10-11 17:33:58

18.8k

Views

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

Published on 11 October 2024 at 17:33

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