Question

Find three nonempty languages, $X, Y$ and $Z$ such that $XZ ⊆ YZ$, but $X$ is not a subset of $Y$.

score 63 · Answer 1 · 2026-03-27 18:49:36

63

Views

Find three nonempty languages, $X, Y$ and $Z$ such that $XZ ⊆ YZ$, but $X$ is not a subset of $Y$.

Published on 27 Mar 2026 - 18:49

score 249 · Answer 2 · 2026-03-26 09:41:54

249

Views

In finite semigroup, if $ef = f$ for $e,f \in E(S)$ and $e = xy, f = yx, s = sx = se = sf$ then we could not have $fe = e$

Published on 26 Mar 2026 - 9:41

score 135 · Answer 3 · 2026-03-25 11:12:25

135

Views

formal grammar from automaton

Published on 25 Mar 2026 - 11:12

score 40 · Answer 4 · 2026-03-26 06:12:42

40

Views

Unable to get a terminal at the start for the GNF

Published on 26 Mar 2026 - 6:12

score 175 · Answer 5 · 2026-03-22 02:52:27

175

Views

Representing operations in reverse Polish notation/postfix that return multiple values

Published on 22 Mar 2026 - 2:52

score 68 · Answer 6 · 2026-03-25 12:53:28

68

Views

Making the difference of a Non-Finite Deterministic Automaton.

Published on 25 Mar 2026 - 12:53

score 43 · Answer 7 · 2016-09-25 11:08:07

43

Views

Find languages $\ L_1$ and $\ L_2$ such that the lengths equal $\ k+1$

Published on 25 Sep 2016 - 11:08

score 860 · Answer 8 · 2026-03-27 13:18:37

860

Views

How to check deterministically that the stack is empty in a PDA?

Published on 27 Mar 2026 - 13:18

score 824 · Answer 9 · 2026-03-26 04:32:47

824

Views

Single state PDA for $L = \{ a^nb^n \mid n\ge 0 \}$

Published on 26 Mar 2026 - 4:32

score 63 · Answer 10 · 2026-03-26 04:30:49

63

Views

Give a context free grammar for the language

Published on 26 Mar 2026 - 4:30

score 6.8k · Answer 11 · 2026-03-25 11:16:44

6.8k

Views

The context free grammar for language $L = \{a^nb^mc^k \mid k = |n - m|, n≥0,m≥0,k≥0\}$ is

Published on 25 Mar 2026 - 11:16

score 192 · Answer 12 · 2016-10-13 14:19:27

192

Views

What is Formal Logic and How do Formal Languages Come in Useful

Published on 13 Oct 2016 - 14:19

score 105 · Answer 13 · 2016-10-14 09:15:00

105

Views

Ways of forming palindromic strings

Published on 14 Oct 2016 - 9:15

score 196 · Answer 14 · 2026-02-23 04:55:06

196

Views

Please guide me: How does a non-academic mathematician find relevant info on the internet?

Published on 23 Feb 2026 - 4:55

score 83 · Answer 15 · 2026-03-25 19:05:11

83

Views

Is this mathematically unambiguous. If not, what notation and vocabulary should I use? Left/right map inverses.

Published on 25 Mar 2026 - 19:05

List Question

Find three nonempty languages, $X, Y$ and $Z$ such that $XZ ⊆ YZ$, but $X$ is not a subset of $Y$.

In finite semigroup, if $ef = f$ for $e,f \in E(S)$ and $e = xy, f = yx, s = sx = se = sf$ then we could not have $fe = e$

formal grammar from automaton

Unable to get a terminal at the start for the GNF

Representing operations in reverse Polish notation/postfix that return multiple values

Making the difference of a Non-Finite Deterministic Automaton.

Find languages $\ L_1$ and $\ L_2$ such that the lengths equal $\ k+1$

How to check deterministically that the stack is empty in a PDA?

Single state PDA for $L = \{ a^nb^n \mid n\ge 0 \}$

Give a context free grammar for the language

The context free grammar for language $L = \{a^nb^mc^k \mid k = |n - m|, n≥0,m≥0,k≥0\}$ is

What is Formal Logic and How do Formal Languages Come in Useful

Ways of forming palindromic strings

Please guide me: How does a non-academic mathematician find relevant info on the internet?

Is this mathematically unambiguous. If not, what notation and vocabulary should I use? Left/right map inverses.

Trending Questions

Popular # Hahtags

Popular Questions