Question

Give a grammar complement to a non-CFL language

score 118 · Answer 1 · 2026-03-26 01:07:25

118

Views

Give a grammar complement to a non-CFL language

Published on 26 Mar 2026 - 1:07

score 191 · Answer 2 · 2026-03-26 21:12:20

191

Views

what are the cases that we can say that the lambda term is not typable?

Published on 26 Mar 2026 - 21:12

score 101 · Answer 3 · 2026-03-27 14:02:09

101

Views

Is the theory of regular formal languages finitely axiomatizable?

Published on 27 Mar 2026 - 14:02

score 249 · Answer 4 · 2026-03-25 17:38:10

249

Views

Estimating meta-mathematical properties of conjectures

Published on 25 Mar 2026 - 17:38

score 40 · Answer 5 · 2026-03-26 22:13:18

40

Views

How does Non-regular subset of Regular languages not violate Chomsky hierarchy?

Published on 26 Mar 2026 - 22:13

score 31 · Answer 6 · 2019-12-17 06:10:46

31

Views

Predicate Logic: Finding languages $L_i$ to fulfill well formed formula

Published on 17 Dec 2019 - 6:10

score 46 · Answer 7 · 2026-03-26 22:14:13

46

Views

Is language of prefixes of context-sensitive language context-sensitive

Published on 26 Mar 2026 - 22:14

score 95 · Answer 8 · 2026-02-23 06:38:42

95

Views

Decidability of halting problem for special kind of automata

Published on 23 Feb 2026 - 6:38

score 18 · Answer 9 · 2019-12-22 17:05:13

18

Views

name of this notation for defining a set/type: e.g. $\mathbb N = 0 | \sigma \mathbb N$, or e.g. $S = 0 | 1 | SS$?

Published on 22 Dec 2019 - 17:05

score 84 · Answer 10 · 2026-03-25 15:59:14

84

Views

Non-string symbolic languages (e.g. diagrams) as "formal languages"

Published on 25 Mar 2026 - 15:59

score 455 · Answer 11 · 2026-03-25 07:43:07

455

Views

What is the relation between a formal "calculus" and a formal "grammar?"

Published on 25 Mar 2026 - 7:43

score 201 · Answer 12 · 2019-12-26 05:29:22

201

Views

How to prove the idempotence of consequence operator?

Published on 26 Dec 2019 - 5:29

score 159 · Answer 13 · 2026-03-25 18:55:38

159

Views

An example of group which is regularly presented, but not finitely presented

Published on 25 Mar 2026 - 18:55

score 33 · Answer 14 · 2026-03-25 18:57:45

33

Views

Can the context-sensitivity of word problem in group $G$ be equivalently characterised through some structural properties of $G$?

Published on 25 Mar 2026 - 18:57

score 43 · Answer 15 · 2019-12-29 13:34:35

43

Views

Language of Recursively enumerable languages

Published on 29 Dec 2019 - 13:34

List Question

Give a grammar complement to a non-CFL language

what are the cases that we can say that the lambda term is not typable?

Is the theory of regular formal languages finitely axiomatizable?

Estimating meta-mathematical properties of conjectures

How does Non-regular subset of Regular languages not violate Chomsky hierarchy?

Predicate Logic: Finding languages $L_i$ to fulfill well formed formula

Is language of prefixes of context-sensitive language context-sensitive

Decidability of halting problem for special kind of automata

name of this notation for defining a set/type: e.g. $\mathbb N = 0 | \sigma \mathbb N$, or e.g. $S = 0 | 1 | SS$?

Non-string symbolic languages (e.g. diagrams) as "formal languages"

What is the relation between a formal "calculus" and a formal "grammar?"

How to prove the idempotence of consequence operator?

An example of group which is regularly presented, but not finitely presented

Can the context-sensitivity of word problem in group $G$ be equivalently characterised through some structural properties of $G$?

Language of Recursively enumerable languages

Trending Questions

Popular # Hahtags

Popular Questions