Question

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

score 282 · Answer 1 · 2024-12-30 18:25:58

282

Views

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

Published on 30 December 2024 at 18:25

score 265 · Answer 2 · 2024-12-26 10:27:00

265

Views

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

Published on 26 December 2024 at 10:27

score 1.2k · Answer 3 · 2024-12-29 04:00:37

1.2k

Views

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

Published on 29 December 2024 at 04:00

score 299 · Answer 4 · 2024-12-26 11:37:23

299

Views

Bisimulation in state transition system

Published on 26 December 2024 at 11:37

score 489 · Answer 5 · 2024-12-26 11:41:33

489

Views

Lexical analyser : how to identify the end of a token

Published on 26 December 2024 at 11:41

score 3.7k · Answer 6 · 2025-01-02 15:03:51

3.7k

Views

Is ε terminal in context-free?

Published on 02 January 2025 at 15:03

score 449 · Answer 7 · 2024-12-27 12:15:52

449

Views

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

Published on 27 December 2024 at 12:15

score 279 · Answer 8 · 2024-12-30 18:21:53

279

Views

Simple explanation of PDA accept states?

Published on 30 December 2024 at 18:21

score 271 · Answer 9 · 2025-01-03 01:53:31

271

Views

automata theorem: existance of a DFA

Published on 03 January 2025 at 01:53

score 382 · Answer 10 · 2024-12-29 04:15:42

382

Views

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

Published on 29 December 2024 at 04:15

score 17.7k · Answer 11 · 2024-12-26 10:15:07

17.7k

Views

DFA that contains 1101 as a substring

Published on 26 December 2024 at 10:15

score 269 · Answer 12 · 2025-01-03 01:33:59

269

Views

Number of Turing Machines?

Published on 03 January 2025 at 01:33

score 687 · Answer 13 · 2024-12-30 18:32:50

687

Views

1 or 2 right hand side variable in Context free language

Published on 30 December 2024 at 18:32

score 201 · Answer 14 · 2024-12-26 10:13:49

201

Views

I'm trying to solve DFA

Published on 26 December 2024 at 10:13

score 179 · Answer 15 · 2024-12-26 11:33:39

179

Views

Automata on ruby

Published on 26 December 2024 at 11:33

score 866 · Answer 16 · 2025-01-03 02:03:49

866

Views

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

Published on 03 January 2025 at 02:03

score 553 · Answer 17 · 2025-01-03 01:41:16

553

Views

What regular language intersects with 10 gives 1n0n

Published on 03 January 2025 at 01:41

score 529 · Answer 18 · 2025-01-04 19:59:09

529

Views

Difference between Transducer and NFA

Published on 04 January 2025 at 19:59

score 1.2k · Answer 19 · 2025-01-03 01:36:14

1.2k

Views

Context free grammar for this language

Published on 03 January 2025 at 01:36

score 18.8k · Answer 20 · 2024-12-26 02:45:49

18.8k

Views

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

Published on 26 December 2024 at 02:45

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