Question

Proving equality of two regular languages using operations closed under regular languages

score 383 · Answer 1 · 2026-04-13 05:15:38

383

Views

Proving equality of two regular languages using operations closed under regular languages

Published on 13 Apr 2026 - 5:15

score 598 · Answer 2 · 2026-04-14 09:20:11

598

Views

An example of non-empty regular language for which a DFA with single accepting state doesn't exist

Published on 14 Apr 2026 - 9:20

score 622 · Answer 3 · 2026-04-12 00:49:38

622

Views

Is empty language a singly capacitated regular language?

Published on 12 Apr 2026 - 0:49

score 110 · Answer 4 · 2026-04-14 22:01:18

110

Views

Design a finite automaton that recognizes a word that begins with $a$ and even number of $b$

Published on 14 Apr 2026 - 22:01

score 88 · Answer 5 · 2026-04-12 06:30:26

88

Views

How to characterize a regular language for which exists a DFA which has a single accepting state?

Published on 12 Apr 2026 - 6:30

score 88 · Answer 6 · 2026-04-13 18:58:41

88

Views

How to use product automaton and intermediate state to prove existence of regular language?

Published on 13 Apr 2026 - 18:58

score 54 · Answer 7 · 2026-04-08 22:15:31

54

Views

How to find errors in the definition of DFA which expands upon another DFA?

Published on 08 Apr 2026 - 22:15

score 590 · Answer 8 · 2026-05-10 15:10:34

590

Views

Inductive Proof With Regular Expression

Published on 10 May 2026 - 15:10

score 268 · Answer 9 · 2026-04-15 21:41:22

268

Views

Drawing a dfsa where L is a set of strings that contains at most 4 zeros

Published on 15 Apr 2026 - 21:41

score 53 · Answer 10 · 2026-05-10 15:13:09

53

Views

Show that $R^{+} \equiv R \leftrightarrow L(RR) \subset L(R)$

Published on 10 May 2026 - 15:13

score 222 · Answer 11 · 2026-05-10 14:07:45

222

Views

How to determine the beginning of $uv^iw$ in the pumping lemma for regular languages?

Published on 10 May 2026 - 14:07

score 608 · Answer 12 · 2026-05-10 12:50:33

608

Views

Binary prime numbers: grammar

Published on 10 May 2026 - 12:50

score 913 · Answer 13 · 2026-05-10 15:13:22

913

Views

Proving that L is not regular by showing that $\equiv_L$ has infinite index

Published on 10 May 2026 - 15:13

score 843 · Answer 14 · 2026-03-25 12:13:56

843

Views

DFA Minimization: Finding all Nerode equivalence classes.

Published on 25 Mar 2026 - 12:13

score 70 · Answer 15 · 2026-04-16 01:39:30

Let $L_4$ be the language over alphabet $\{0, 1\}$ defined by $L_3 = \{x : \#_1(x) = 2 \cdot \#_{10}(x)\}$ design for a PDA that accepts $L_4$

List Question

Proving equality of two regular languages using operations closed under regular languages

An example of non-empty regular language for which a DFA with single accepting state doesn't exist

Is empty language a singly capacitated regular language?

Design a finite automaton that recognizes a word that begins with $a$ and even number of $b$

How to characterize a regular language for which exists a DFA which has a single accepting state?

How to use product automaton and intermediate state to prove existence of regular language?

How to find errors in the definition of DFA which expands upon another DFA?

Inductive Proof With Regular Expression

Drawing a dfsa where L is a set of strings that contains at most 4 zeros

Show that $R^{+} \equiv R \leftrightarrow L(RR) \subset L(R)$

How to determine the beginning of $uv^iw$ in the pumping lemma for regular languages?

Binary prime numbers: grammar

Proving that L is not regular by showing that $\equiv_L$ has infinite index

DFA Minimization: Finding all Nerode equivalence classes.

Let $L_4$ be the language over alphabet $\{0, 1\}$ defined by $L_3 = \{x : \#_1(x) = 2 \cdot \#_{10}(x)\}$ design for a PDA that accepts $L_4$

Trending Questions

Popular # Hahtags

Popular Questions