Question

If $P$ violates a liveness property $\phi$, does $P$ have a lasso run $r$ violating $\phi$?

score 54 · Answer 1 · 2020-01-08 04:38:13

54

Views

If $P$ violates a liveness property $\phi$, does $P$ have a lasso run $r$ violating $\phi$?

Published on 08 Jan 2020 - 4:38

score 2.3k · Answer 2 · 2026-03-25 04:41:41

2.3k

Views

Proving that $L = \left\{a^{n^2} | n \ge 0\right\}$ is not context free with Pumping Lemma for CFG?

Published on 25 Mar 2026 - 4:41

score 144 · Answer 3 · 2020-01-15 08:43:30

144

Views

Converting a DFA to a regular expression

Published on 15 Jan 2020 - 8:43

score 167 · Answer 4 · 2020-01-15 16:39:47

167

Views

Creating a state diagram for a DFA

Published on 15 Jan 2020 - 16:39

score 82 · Answer 5 · 2026-03-22 15:01:44

82

Views

Does both the language and its complement being context free imply it being deterministic context-free?

Published on 22 Mar 2026 - 15:01

score 345 · Answer 6 · 2026-03-26 02:41:32

345

Views

Idempotent, commutative and invertible

Published on 26 Mar 2026 - 2:41

score 255 · Answer 7 · 2026-03-16 22:02:22

255

Views

Converting NFAs to DFAs

Published on 16 Mar 2026 - 22:02

score 950 · Answer 8 · 2026-03-26 01:01:37

950

Views

If we remove one string from any nonempty regular set, the resulting set is still regular.

Published on 26 Mar 2026 - 1:01

score 351 · Answer 9 · 2020-01-21 04:12:05

351

Views

Constructing an NFA given a language DF(A) = {a2...ak | a1a2... ak ∈ A}.

Published on 21 Jan 2020 - 4:12

score 478 · Answer 10 · 2020-01-21 05:37:54

478

Views

T or F: The subset of a regular set over {a, b, c} consisting of just those strings that don’t use the symbol c is regular.

Published on 21 Jan 2020 - 5:37

score 33 · Answer 11 · 2020-01-27 13:26:44

33

Views

Cycles in paths of certain length in an NFA

Published on 27 Jan 2020 - 13:26

score 91 · Answer 12 · 2026-03-25 22:03:28

91

Views

Pushdown automata for $\left\{ a^nb^mc^{n+m} \colon m,n \in \mathbb{N}_0 \right\} $

Published on 25 Mar 2026 - 22:03

score 201 · Answer 13 · 2020-01-30 04:10:23

201

Views

Proving that if $C$ is a prefix code then it is uniquely decipherable?

Published on 30 Jan 2020 - 4:10

score 35 · Answer 14 · 2020-01-30 06:39:42

35

Views

Would this language be regular?

Published on 30 Jan 2020 - 6:39

score 200 · Answer 15 · 2026-03-25 23:39:23

200

Views

Is $L$ regular? context free but not regular? Neither? $L = \{ xwx : x,w \in \{a,b,c \}^*, |x| > 0\}$

Published on 25 Mar 2026 - 23:39

List Question

If $P$ violates a liveness property $\phi$, does $P$ have a lasso run $r$ violating $\phi$?

Proving that $L = \left\{a^{n^2} | n \ge 0\right\}$ is not context free with Pumping Lemma for CFG?

Converting a DFA to a regular expression

Creating a state diagram for a DFA

Does both the language and its complement being context free imply it being deterministic context-free?

Idempotent, commutative and invertible

Converting NFAs to DFAs

If we remove one string from any nonempty regular set, the resulting set is still regular.

Constructing an NFA given a language DF(A) = {a2...ak | a1a2... ak ∈ A}.

T or F: The subset of a regular set over {a, b, c} consisting of just those strings that don’t use the symbol c is regular.

Cycles in paths of certain length in an NFA

Pushdown automata for $\left\{ a^nb^mc^{n+m} \colon m,n \in \mathbb{N}_0 \right\} $

Proving that if $C$ is a prefix code then it is uniquely decipherable?

Would this language be regular?

Is $L$ regular? context free but not regular? Neither? $L = \{ xwx : x,w \in \{a,b,c \}^*, |x| > 0\}$

Trending Questions

Popular # Hahtags

Popular Questions