Question

Given a finite automaton determine if it is deterministic and indicate regular expression

score 226 · Answer 1 · 2026-05-10 14:04:39

226

Views

Given a finite automaton determine if it is deterministic and indicate regular expression

Published on 10 May 2026 - 14:04

score 615 · Answer 2 · 2026-04-15 05:24:32

615

Views

Finite automata where the difference in the number of a's and b's is less than three

Published on 15 Apr 2026 - 5:24

score 438 · Answer 3 · 2026-04-15 12:27:17

438

Views

Is it ALWAYS true that if L= {w|odd(w) is regular} then L is regular.

Published on 15 Apr 2026 - 12:27

score 43 · Answer 4 · 2026-04-11 06:13:57

43

Views

Proving commutativeness of an operator using structural induction

Published on 11 Apr 2026 - 6:13

score 216 · Answer 5 · 2026-04-16 13:00:05

216

Views

square-free word

Published on 16 Apr 2026 - 13:00

score 298 · Answer 6 · 2026-05-10 14:05:47

298

Views

Simply starred language. $\left\{(ab)^n:n\in\mathbb{N}\right\}$ it is regular?

Published on 10 May 2026 - 14:05

score 46 · Answer 7 · 2026-05-10 14:04:22

46

Views

What is open first in formal languages

Published on 10 May 2026 - 14:04

score 65 · Answer 8 · 2026-05-10 14:03:56

65

Views

String powers. Lemma 1.3.5 in word processing in groups. Epstein.

Published on 10 May 2026 - 14:03

score 167 · Answer 9 · 2026-04-19 20:50:55

167

Views

Showing that a Language is regular using a state machine diagram

Published on 19 Apr 2026 - 20:50

score 313 · Answer 10 · 2026-05-10 12:54:04

313

Views

If $A$ is not a regular language and $B$ is a regular language and $B \neq \varnothing$, does $AB$ is not regular language?

Published on 10 May 2026 - 12:54

score 951 · Answer 11 · 2026-05-05 02:06:13

951

Views

Prove that a language which consists of concatenation of strings in palindromes is not a regular language?

Published on 05 May 2026 - 2:06

score 2k · Answer 12 · 2026-05-10 14:03:03

2k

Views

Regular Language and Non-Regular Language

Published on 10 May 2026 - 14:03

score 752 · Answer 13 · 2026-04-15 21:21:54

752

Views

Proving $ww^Ru$ is not a regular language with Pumping Lemma

Published on 15 Apr 2026 - 21:21

score 80 · Answer 14 · 2026-05-10 14:03:01

80

Views

What's wrong with this proof? (Regular languages)

Published on 10 May 2026 - 14:03

score 69 · Answer 15 · 2026-05-10 14:04:23

69

Views

How Can The Following Language Possibly Be Regular?

Published on 10 May 2026 - 14:04

List Question

Given a finite automaton determine if it is deterministic and indicate regular expression

Finite automata where the difference in the number of a's and b's is less than three

Is it ALWAYS true that if L= {w|odd(w) is regular} then L is regular.

Proving commutativeness of an operator using structural induction

square-free word

Simply starred language. $\left\{(ab)^n:n\in\mathbb{N}\right\}$ it is regular?

What is open first in formal languages

String powers. Lemma 1.3.5 in word processing in groups. Epstein.

Showing that a Language is regular using a state machine diagram

If $A$ is not a regular language and $B$ is a regular language and $B \neq \varnothing$, does $AB$ is not regular language?

Prove that a language which consists of concatenation of strings in palindromes is not a regular language?

Regular Language and Non-Regular Language

Proving $ww^Ru$ is not a regular language with Pumping Lemma

What's wrong with this proof? (Regular languages)

How Can The Following Language Possibly Be Regular?

Trending Questions

Popular # Hahtags

Popular Questions