Question

Is $M(L)=\left\{w \in L \mid \forall v \in \Sigma^+,vw \notin L\right\}$context-free?

score 187 · Answer 1 · 2026-03-26 15:39:43

187

Views

Is $M(L)=\left\{w \in L \mid \forall v \in \Sigma^+,vw \notin L\right\}$context-free?

Published on 26 Mar 2026 - 15:39

score 47 · Answer 2 · 2023-11-10 13:34:05

47

Views

Number of automatas in single output automaton of n inputs

Published on 10 Nov 2023 - 13:34

score 25 · Answer 3 · 2023-11-17 16:08:34

Alpern, B., Schneider, F.B. Recognizing safety and liveness. Distrib Comput 2, 117–126 (1987). Is there is a mistake in the proof?

score 65 · Answer 4 · 2026-03-26 17:14:20

How to show that the language $L = \{a^n , n \geq 10000 \text{ and $n$ is prime number}\}$ is not context-free using closure property?

score 65 · Answer 5 · 2023-12-04 12:45:33

The number of states of (Stochastic) Probabilistic Finite Automata that accepts string that is divisible by 3 and 5 (two distinct primes)?

score 62 · Answer 6 · 2026-03-25 06:11:54

62

Views

Schutzenberger graphs of an Inverse Semigroup?

Published on 25 Mar 2026 - 6:11

score 71 · Answer 7 · 2026-02-23 08:22:07

71

Views

Finite Games winning strategy exercises

Published on 23 Feb 2026 - 8:22

score 41 · Answer 8 · 2024-01-11 00:40:53

41

Views

Is this construction of a DFA from a NFA wrong?

Published on 11 Jan 2024 - 0:40

score 79 · Answer 9 · 2026-03-26 17:30:49

79

Views

How to show that only this regular expression solves this equation

Published on 26 Mar 2026 - 17:30

score 146 · Answer 10 · 2024-01-15 18:58:09

146

Views

Can WS1S encode any power of $2$?

Published on 15 Jan 2024 - 18:58

score 40 · Answer 11 · 2026-03-22 08:22:29

40

Views

Can someone explain to me what this transition means here: a, Z : AZ

Published on 22 Mar 2026 - 8:22

score 33 · Answer 12 · 2024-02-11 02:56:10

33

Views

Designing a DFA with n States for Maximum L* Learning Rounds

Published on 11 Feb 2024 - 2:56

score 85 · Answer 13 · 2026-03-26 22:15:14

85

Views

The minimal ideal of a finite semigroup whose idempotents commute

Published on 26 Mar 2026 - 22:15

score 38 · Answer 14 · 2026-03-28 12:13:21

38

Views

Why do we need empty string transitions in the NFA intended to accept this singleton language?

Published on 28 Mar 2026 - 12:13

score 41 · Answer 15 · 2024-02-18 19:53:29

41

Views

If $L$ is regular, is $L' = \{xz \mid \exists y, y \in \Sigma^* \text{ such that } |x|=|y|=|z|\text{ and }xyz \in L\}$ regular?

Published on 18 Feb 2024 - 19:53

List Question

Is $M(L)=\left\{w \in L \mid \forall v \in \Sigma^+,vw \notin L\right\}$context-free?

Number of automatas in single output automaton of n inputs

Alpern, B., Schneider, F.B. Recognizing safety and liveness. Distrib Comput 2, 117–126 (1987). Is there is a mistake in the proof?

How to show that the language $L = \{a^n , n \geq 10000 \text{ and $n$ is prime number}\}$ is not context-free using closure property?

The number of states of (Stochastic) Probabilistic Finite Automata that accepts string that is divisible by 3 and 5 (two distinct primes)?

Schutzenberger graphs of an Inverse Semigroup?

Finite Games winning strategy exercises

Is this construction of a DFA from a NFA wrong?

How to show that only this regular expression solves this equation

Can WS1S encode any power of $2$?

Can someone explain to me what this transition means here: a, Z : AZ

Designing a DFA with n States for Maximum L* Learning Rounds

The minimal ideal of a finite semigroup whose idempotents commute

Why do we need empty string transitions in the NFA intended to accept this singleton language?

If $L$ is regular, is $L' = \{xz \mid \exists y, y \in \Sigma^* \text{ such that } |x|=|y|=|z|\text{ and }xyz \in L\}$ regular?

Trending Questions

Popular # Hahtags

Popular Questions