Question

Question on proof related to inclusion relations of principal ideals generated by elements.

score 76 · Answer 1 · 2026-03-22 12:27:46

76

Views

Question on proof related to inclusion relations of principal ideals generated by elements.

Published on 22 Mar 2026 - 12:27

score 34 · Answer 2 · 2018-06-22 06:25:00

34

Views

Is $L=\{w_1 c w_2\mid w_1,\ w_2\in\{a,b\}^*,\ w_1≠w_2\}$ context free?

Published on 22 Jun 2018 - 6:25

score 80 · Answer 3 · 2026-03-24 23:46:14

80

Views

Prove $L$ is context free if $L_1$, $L_2$, $L_3$ are regular by building a suitable grammar

Published on 24 Mar 2026 - 23:46

score 70 · Answer 4 · 2026-03-20 00:34:56

70

Views

Inclusion relations between equationally defined classes of finite semigroups

Published on 20 Mar 2026 - 0:34

score 97 · Answer 5 · 2018-06-27 12:02:07

97

Views

Does εε = ε in formal languages?

Published on 27 Jun 2018 - 12:02

score 101 · Answer 6 · 2018-07-02 16:36:34

101

Views

Is a circular reference a type of simultaneous equation?

Published on 02 Jul 2018 - 16:36

score 196 · Answer 7 · 2026-03-25 06:11:03

196

Views

Can truth be defined by a 'same-level' language according to Tarski's undefinability theorem?

Published on 25 Mar 2026 - 6:11

score 117 · Answer 8 · 2026-03-25 15:47:05

117

Views

A kind of pumping lemma for finitely generated groups

Published on 25 Mar 2026 - 15:47

score 977 · Answer 9 · 2026-03-25 05:59:03

977

Views

DFA accepts only one state

Published on 25 Mar 2026 - 5:59

score 1.8k · Answer 10 · 2026-03-25 01:14:05

1.8k

Views

Are context free languages closed under taking substring?

Published on 25 Mar 2026 - 1:14

score 99 · Answer 11 · 2018-07-30 21:33:05

99

Views

Is it possible to have equality in the body or head of the implication of the first order logic?

Published on 30 Jul 2018 - 21:33

score 145 · Answer 12 · 2026-03-24 23:48:13

145

Views

Construct a grammar that generates the language $L = \{ a^x b^{x-y} c^y \mid x > y > 0 \text{ and } (x + y) \text{ is even }\}$

Published on 24 Mar 2026 - 23:48

score 146 · Answer 13 · 2026-03-25 01:22:28

146

Views

Convert Context-Free Grammar to Automata

Published on 25 Mar 2026 - 1:22

score 108 · Answer 14 · 2018-08-17 20:18:58

108

Views

Rigorous definition of linear dependence

Published on 17 Aug 2018 - 20:18

score 3.1k · Answer 15 · 2018-08-19 01:20:03

3.1k

Views

How are quantifiers managed in truth tables?

Published on 19 Aug 2018 - 1:20

List Question

Question on proof related to inclusion relations of principal ideals generated by elements.

Is $L=\{w_1 c w_2\mid w_1,\ w_2\in\{a,b\}^*,\ w_1≠w_2\}$ context free?

Prove $L$ is context free if $L_1$, $L_2$, $L_3$ are regular by building a suitable grammar

Inclusion relations between equationally defined classes of finite semigroups

Does εε = ε in formal languages?

Is a circular reference a type of simultaneous equation?

Can truth be defined by a 'same-level' language according to Tarski's undefinability theorem?

A kind of pumping lemma for finitely generated groups

DFA accepts only one state

Are context free languages closed under taking substring?

Is it possible to have equality in the body or head of the implication of the first order logic?

Construct a grammar that generates the language $L = \{ a^x b^{x-y} c^y \mid x > y > 0 \text{ and } (x + y) \text{ is even }\}$

Convert Context-Free Grammar to Automata

Rigorous definition of linear dependence

How are quantifiers managed in truth tables?

Trending Questions

Popular # Hahtags

Popular Questions