Question

Modifying the formal grammar of first-order logic

score 161 · Answer 1 · 2026-03-25 09:37:02

161

Views

Modifying the formal grammar of first-order logic

Published on 25 Mar 2026 - 9:37

score 512 · Answer 2 · 2026-03-25 09:39:57

512

Views

Is this language regular? $L = \{ xyyz \in \{0,1 \}^* \colon x,z \in \{0,1 \}^*, y \in \{0, 1\}^+\}$

Published on 25 Mar 2026 - 9:39

score 78 · Answer 3 · 2026-03-25 09:40:03

78

Views

What kind of language is $\{\text{bin}(n)\text{oct}(n)^R \colon n \in \mathbb{N} \}$? Regular? Context-free? Neither? Prove.

Published on 25 Mar 2026 - 9:40

score 55 · Answer 4 · 2026-04-01 08:28:46

55

Views

Logics and formal grammars

Published on 01 Apr 2026 - 8:28

score 71 · Answer 5 · 2026-03-25 09:39:59

71

Views

Defining a grammar $G$ for the language $\mathcal L(G) = \{a^i b^j c^k \mid 0 \leq i < j < k\}$

Published on 25 Mar 2026 - 9:39

score 51 · Answer 6 · 2026-03-25 16:02:20

51

Views

Which part of the string $00011112222$ can be pumped?

Published on 25 Mar 2026 - 16:02

score 193 · Answer 7 · 2026-04-08 08:41:44

193

Views

Are axioms in math equivalent to production rules in unrestricted grammars?

Published on 08 Apr 2026 - 8:41

score 69 · Answer 8 · 2026-03-25 06:03:44

69

Views

Proof for pumping lemma for new kind of CFL

Published on 25 Mar 2026 - 6:03

score 44 · Answer 9 · 2026-03-25 09:33:55

44

Views

Converting linear grammar to normal form

Published on 25 Mar 2026 - 9:33

score 20 · Answer 10 · 2026-03-25 09:35:48

20

Views

Does formal language theory have concepts corresponding to dependency grammars?

Published on 25 Mar 2026 - 9:35

score 20 · Answer 11 · 2026-03-25 09:38:34

20

Views

In inline equations, should I use parentheses to represent the sum of two or more variables?

Published on 25 Mar 2026 - 9:38

score 86 · Answer 12 · 2026-03-25 09:43:09

86

Views

Context free grammar for language $\{ \{a,b\}^*$: where the number of $a$'s is unequal to the number of $b$'s$\}$

Published on 25 Mar 2026 - 9:43

score 60 · Answer 13 · 2026-05-01 02:41:48

60

Views

Is the set of all grammatically correct words a lattice and is there grammar for which this set is not lattice?

Published on 01 May 2026 - 2:41

score 474 · Answer 14 · 2026-04-01 15:48:37

474

Views

Define "first-order language" without using it

Published on 01 Apr 2026 - 15:48

score 2.6k · Answer 15 · 2026-04-15 05:27:55

2.6k

Views

Is there any language that $\bar L^= (\bar L)^$?

Published on 15 Apr 2026 - 5:27

List Question

Modifying the formal grammar of first-order logic

Is this language regular? $L = \{ xyyz \in \{0,1 \}^* \colon x,z \in \{0,1 \}^*, y \in \{0, 1\}^+\}$

What kind of language is $\{\text{bin}(n)\text{oct}(n)^R \colon n \in \mathbb{N} \}$? Regular? Context-free? Neither? Prove.

Logics and formal grammars

Defining a grammar $G$ for the language $\mathcal L(G) = \{a^i b^j c^k \mid 0 \leq i < j < k\}$

Which part of the string $00011112222$ can be pumped?

Are axioms in math equivalent to production rules in unrestricted grammars?

Proof for pumping lemma for new kind of CFL

Converting linear grammar to normal form

Does formal language theory have concepts corresponding to dependency grammars?

In inline equations, should I use parentheses to represent the sum of two or more variables?

Context free grammar for language $\{ \{a,b\}^*$: where the number of $a$'s is unequal to the number of $b$'s$\}$

Is the set of all grammatically correct words a lattice and is there grammar for which this set is not lattice?

Define "first-order language" without using it

Is there any language that $\bar L^= (\bar L)^$?

Trending Questions

Popular # Hahtags

Popular Questions