Question

Grammar for a^n

score 78 · Answer 1 · 2024-12-29 03:51:46

78

Views

Grammar for a^n

Published on 29 December 2024 at 03:51

score 681 · Answer 2 · 2025-01-03 02:10:19

681

Views

Can final and non-final states having identical configurations be merged together in a minimal DFA?

Published on 03 January 2025 at 02:10

score 246 · Answer 3 · 2025-01-03 01:58:46

246

Views

Finding DFA of r* when r and DFA of r were deifined

Published on 03 January 2025 at 01:58

score 367 · Answer 4 · 2025-01-02 12:06:40

367

Views

How to call a structured language that cannot loop or a functional language that cannot return

Published on 02 January 2025 at 12:06

score 546 · Answer 5 · 2025-01-03 01:41:16

546

Views

What regular language intersects with 10 gives 1n0n

Published on 03 January 2025 at 01:41

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

1.2k

Views

Context free grammar for this language

Published on 03 January 2025 at 01:36

score 4.8k · Answer 7 · 2024-12-30 18:40:35

4.8k

Views

What type of languages are accepted by a PDA in which stack size is limited?

Published on 30 December 2024 at 18:40

score 3.6k · Answer 8 · 2025-01-03 01:34:38

3.6k

Views

Finiteness of Regular Language

Published on 03 January 2025 at 01:34

score 9.3k · Answer 9 · 2025-01-03 01:37:55

9.3k

Views

Notation for concat in set theory

Published on 03 January 2025 at 01:37

score 4.4k · Answer 10 · 2025-01-03 01:38:11

4.4k

Views

Python implementation for the CYK Algorithm

Published on 03 January 2025 at 01:38

score 852 · Answer 11 · 2024-12-30 18:16:58

852

Views

CFG for a = b and c = d (length)

Published on 30 December 2024 at 18:16

score 270 · Answer 12 · 2024-12-30 18:45:41

270

Views

In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitution rule to only of the variable of same type?

Published on 30 December 2024 at 18:45

score 795 · Answer 13 · 2025-01-03 01:38:03

795

Views

When to use Ø for states in DFA / NFA

Published on 03 January 2025 at 01:38

score 3.5k · Answer 14 · 2025-01-03 01:42:05

3.5k

Views

Design a turing machine to accept {1^n : n is prime number}

Published on 03 January 2025 at 01:42

score 662 · Answer 15 · 2025-01-03 01:43:10

662

Views

How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?

Published on 03 January 2025 at 01:43

score 154 · Answer 16 · 2025-01-03 01:38:48

154

Views

I want regular expression (theory of automata)

Published on 03 January 2025 at 01:38

score 196 · Answer 17 · 2025-01-03 01:40:13

196

Views

Linear temporal logic (LTL) nad automata modelling

Published on 03 January 2025 at 01:40

score 1.6k · Answer 18 · 2025-01-03 01:34:37

1.6k

Views

Construct Context free Grammar

Published on 03 January 2025 at 01:34

score 67 · Answer 19 · 2025-01-03 01:48:23

67

Views

Are there any problems that are easier to implement on a turing machine than a conventional computer?

Published on 03 January 2025 at 01:48

score 526 · Answer 20 · 2024-12-30 18:23:47

526

Views

construct a PDA for the following language

Published on 30 December 2024 at 18:23

List Question

Grammar for a^n

Can final and non-final states having identical configurations be merged together in a minimal DFA?

Finding DFA of r* when r and DFA of r were deifined

How to call a structured language that cannot loop or a functional language that cannot return

What regular language intersects with 10 gives 1n0n

Context free grammar for this language

What type of languages are accepted by a PDA in which stack size is limited?

Finiteness of Regular Language

Notation for concat in set theory

Python implementation for the CYK Algorithm

CFG for a = b and c = d (length)

In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitution rule to only of the variable of same type?

When to use Ø for states in DFA / NFA

Design a turing machine to accept {1^n : n is prime number}

How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?

I want regular expression (theory of automata)

Linear temporal logic (LTL) nad automata modelling

Construct Context free Grammar

Are there any problems that are easier to implement on a turing machine than a conventional computer?

construct a PDA for the following language

Trending Questions

Popular # Hahtags

Popular Questions