Question

Regex for strings with no three identical consecutive characters

score 19.1k · Answer 1 · 2014-02-22 06:09:15

19.1k

Views

Regex for strings with no three identical consecutive characters

Published on 22 Feb 2014 - 6:09

score 1.7k · Answer 2 · 2026-03-26 06:02:39

1.7k

Views

Regex for strings with at least three unique characters

Published on 26 Mar 2026 - 6:02

score 361 · Answer 3 · 2026-03-25 22:09:37

361

Views

Question About Pumping Lemma used on a FA

Published on 25 Mar 2026 - 22:09

score 1.1k · Answer 4 · 2014-03-01 23:08:32

1.1k

Views

find a regular expression and FA that each define L1 ∩ L2

Published on 01 Mar 2014 - 23:08

score 829 · Answer 5 · 2014-03-05 05:51:15

829

Views

Equivalence of two regular expression

Published on 05 Mar 2014 - 5:51

score 2.6k · Answer 6 · 2014-03-06 03:12:47

2.6k

Views

Prove by induction on a string

Published on 06 Mar 2014 - 3:12

score 149 · Answer 7 · 2014-03-07 02:17:27

149

Views

Example of a Regular Map

Published on 07 Mar 2014 - 2:17

score 139 · Answer 8 · 2014-03-07 15:10:21

139

Views

Question about Notation in a Regular Language

Published on 07 Mar 2014 - 15:10

score 1.2k · Answer 9 · 2017-04-10 07:54:21

1.2k

Views

Design a NFA for the strings having two repetitions of the last symbol, with an extra constraint

Published on 10 Apr 2017 - 7:54

score 425 · Answer 10 · 2026-03-26 12:05:03

425

Views

Find the nearest integer solution to a linear equation

Published on 26 Mar 2026 - 12:05

score 62 · Answer 11 · 2026-03-25 15:44:11

62

Views

How to show that the language containing the words which number of $b$ divides the number of $a$ isn't regular using pumping lemma?

Published on 25 Mar 2026 - 15:44

score 507 · Answer 12 · 2026-03-25 15:42:15

507

Views

How to show that the language containing words which length are prime numbers isn't regular using pumping lemma?

Published on 25 Mar 2026 - 15:42

score 279 · Answer 13 · 2026-03-25 15:44:11

279

Views

How to show that the language containing the words which length are of power of $2$ isn't regular using pumping lemma?

Published on 25 Mar 2026 - 15:44

score 90 · Answer 14 · 2017-04-18 14:59:27

90

Views

How to show that the language containing the words which number of $b$ divides the number of $a$ isn't regular using Myhill-Nerode theorem?

Published on 18 Apr 2017 - 14:59

score 113 · Answer 15 · 2026-03-25 07:47:57

113

Views

Want to clarify and check DFA and NFA attempt

Published on 25 Mar 2026 - 7:47

List Question

Regex for strings with no three identical consecutive characters

Regex for strings with at least three unique characters

Question About Pumping Lemma used on a FA

find a regular expression and FA that each define L1 ∩ L2

Equivalence of two regular expression

Prove by induction on a string

Example of a Regular Map

Question about Notation in a Regular Language

Design a NFA for the strings having two repetitions of the last symbol, with an extra constraint

Find the nearest integer solution to a linear equation

How to show that the language containing the words which number of $b$ divides the number of $a$ isn't regular using pumping lemma?

How to show that the language containing words which length are prime numbers isn't regular using pumping lemma?

How to show that the language containing the words which length are of power of $2$ isn't regular using pumping lemma?

How to show that the language containing the words which number of $b$ divides the number of $a$ isn't regular using Myhill-Nerode theorem?

Want to clarify and check DFA and NFA attempt

Trending Questions

Popular # Hahtags

Popular Questions