Question

Is it semi-decidable whether a context-free grammar generates a regular language?

score 969 · Answer 1 · 2026-02-22 23:35:11

969

Views

Is it semi-decidable whether a context-free grammar generates a regular language?

Published on 22 Feb 2026 - 23:35

score 1.4k · Answer 2 · 2026-03-25 10:58:49

1.4k

Views

Does there exist an uncountably infinite language?

Published on 25 Mar 2026 - 10:58

score 178 · Answer 3 · 2026-03-25 12:20:35

178

Views

Can formal grammar (language) serve as the model for some logic and express the semantics of this logic?

Published on 25 Mar 2026 - 12:20

score 77 · Answer 4 · 2026-03-25 06:07:21

77

Views

a hard mapping reduction problem

Published on 25 Mar 2026 - 6:07

score 77 · Answer 5 · 2026-03-20 20:24:19

77

Views

Is the semidecidability of the valid formula of second order logic dependent upon the semantic?

Published on 20 Mar 2026 - 20:24

score 118 · Answer 6 · 2026-03-24 22:45:50

118

Views

Understanding interpretation of quantified set variables in Herbert Enderton "Second-order and Higher-order logic"

Published on 24 Mar 2026 - 22:45

score 113 · Answer 7 · 2026-03-23 05:23:38

113

Views

Choosing axiom schemes for a logical theory

Published on 23 Mar 2026 - 5:23

score 46 · Answer 8 · 2026-03-25 06:01:36

46

Views

How to prove that a language which clones is regular?

Published on 25 Mar 2026 - 6:01

score 124 · Answer 9 · 2018-06-06 01:21:59

124

Views

Reason it Out: Basic implication reasoning

Published on 06 Jun 2018 - 1:21

score 224 · Answer 10 · 2026-03-24 23:45:49

224

Views

Is $\{a^n b^n c^{2n} \mid n \geqslant 0\}$ a context-free language?

Published on 24 Mar 2026 - 23:45

score 1.7k · Answer 11 · 2026-03-24 23:44:20

1.7k

Views

how to determine if a context free language is deterministic or nondeterministic in general

Published on 24 Mar 2026 - 23:44

score 149 · Answer 12 · 2018-06-11 15:10:10

149

Views

Halmos' Naive Set Theory: On expressing $\{\{x,\;y\}:x \in A \textit{ and } y \in A \textit{ and } x \neq y\}$

Published on 11 Jun 2018 - 15:10

score 80 · Answer 13 · 2026-03-23 01:31:22

80

Views

Equations on the free monoid??

Published on 23 Mar 2026 - 1:31

score 321 · Answer 14 · 2026-03-22 18:57:25

321

Views

The intuitive meaning of "or" and "implies" in axiom schemes of a logical theory

Published on 22 Mar 2026 - 18:57

score 2.4k · Answer 15 · 2026-03-24 23:45:04

2.4k

Views

Prove that language that has unequal 0's and 1's is not regular

Published on 24 Mar 2026 - 23:45

List Question

Is it semi-decidable whether a context-free grammar generates a regular language?

Does there exist an uncountably infinite language?

Can formal grammar (language) serve as the model for some logic and express the semantics of this logic?

a hard mapping reduction problem

Is the semidecidability of the valid formula of second order logic dependent upon the semantic?

Understanding interpretation of quantified set variables in Herbert Enderton "Second-order and Higher-order logic"

Choosing axiom schemes for a logical theory

How to prove that a language which clones is regular?

Reason it Out: Basic implication reasoning

Is $\{a^n b^n c^{2n} \mid n \geqslant 0\}$ a context-free language?

how to determine if a context free language is deterministic or nondeterministic in general

Halmos' Naive Set Theory: On expressing $\{\{x,\;y\}:x \in A \textit{ and } y \in A \textit{ and } x \neq y\}$

Equations on the free monoid??

The intuitive meaning of "or" and "implies" in axiom schemes of a logical theory

Prove that language that has unequal 0's and 1's is not regular

Trending Questions

Popular # Hahtags

Popular Questions