Question

Find the mistakes(pumping lemma proof). Can you help me?

score 48 · Answer 1 · 2026-03-25 10:55:29

48

Views

Find the mistakes(pumping lemma proof). Can you help me?

Published on 25 Mar 2026 - 10:55

score 114 · Answer 2 · 2023-06-05 13:21:35

114

Views

Regular expressions creating language m

Published on 05 Jun 2023 - 13:21

score 54 · Answer 3 · 2026-03-26 17:34:47

54

Views

Regular expression .Find it

Published on 26 Mar 2026 - 17:34

score 75 · Answer 4 · 2026-03-26 14:18:39

75

Views

Are $111^$ and $11^1$ equivalent?

Published on 26 Mar 2026 - 14:18

score 69 · Answer 5 · 2026-02-23 04:41:43

69

Views

Can substrings of a regular language always be recognized by an "isolated" path in some finite state automaton?

Published on 23 Feb 2026 - 4:41

score 62 · Answer 6 · 2026-03-26 14:20:42

62

Views

Find all strings of $w$ that satisfy following equation

Published on 26 Mar 2026 - 14:20

score 47 · Answer 7 · 2023-07-03 15:37:49

47

Views

Computer Science: regular languages

Published on 03 Jul 2023 - 15:37

score 54 · Answer 8 · 2026-03-26 14:21:05

54

Views

Is there a name for the set of single-character prefixes of words in a regular language

Published on 26 Mar 2026 - 14:21

score 48 · Answer 9 · 2023-08-09 03:31:26

48

Views

Generating functions of ambiguous regular languages are still rational?

Published on 09 Aug 2023 - 3:31

score 78 · Answer 10 · 2023-08-31 18:30:16

78

Views

Prove that if M is regular then sandwiched M is regular as well

Published on 31 Aug 2023 - 18:30

score 148 · Answer 11 · 2023-09-07 18:47:55

Let $L$ be a regular language. Prove that $L_1$, the language created by removing all characters in odd places in all words of $L$, is regular

score 395 · Answer 12 · 2023-09-12 19:12:33

395

Views

Regular Expression for the set of all binary strings that are of even length with at least 1 zero

Published on 12 Sep 2023 - 19:12

score 46 · Answer 13 · 2023-09-12 20:18:11

46

Views

Regular Expression for the set of all binary strings that are of even length with at most 2 zeros

Published on 12 Sep 2023 - 20:18

score 67 · Answer 14 · 2026-03-26 19:19:04

67

Views

Is the Language $L = \{a^n b^m c^k d^q e^r \,|\, n, m, k, q, r \geq 0\}$ a Valid Regular Language?

Published on 26 Mar 2026 - 19:19

score 33 · Answer 15 · 2026-03-25 10:56:01

33

Views

Prove a class of regular languages is not closed under a weird concatenation operation

Published on 25 Mar 2026 - 10:56

List Question

Find the mistakes(pumping lemma proof). Can you help me?

Regular expressions creating language m

Regular expression .Find it

Are $111^$ and $11^1$ equivalent?

Can substrings of a regular language always be recognized by an "isolated" path in some finite state automaton?

Find all strings of $w$ that satisfy following equation

Computer Science: regular languages

Is there a name for the set of single-character prefixes of words in a regular language

Generating functions of ambiguous regular languages are still rational?

Prove that if M is regular then sandwiched M is regular as well

Let $L$ be a regular language. Prove that $L_1$, the language created by removing all characters in odd places in all words of $L$, is regular

Regular Expression for the set of all binary strings that are of even length with at least 1 zero

Regular Expression for the set of all binary strings that are of even length with at most 2 zeros

Is the Language $L = \{a^n b^m c^k d^q e^r \,|\, n, m, k, q, r \geq 0\}$ a Valid Regular Language?

Prove a class of regular languages is not closed under a weird concatenation operation

Trending Questions

Popular # Hahtags

Popular Questions