List questions from regular-expressions

Published on 11 Oct 2021 - 16:55

1k

Views

How to write a regular expression for every string w over {0,1} where w is a binary string with value of at least 40.

Published on 12 Oct 2021 - 13:12

122

Views

Context Free Grammar for strings of $z^n$y$x^m$ $w^n$

Published on 18 Oct 2021 - 1:17

403

Views

If $$ is regular, will $L' = \{v\in L:\,\exists w\in L: w = v^R\}$ be regular also?

Published on 18 Oct 2021 - 19:47

91

Views

what is the most recommended book to learn automata and formal languages?

Published on 22 Oct 2021 - 5:00

104

Views

Regular Expressions and intersection.

Published on 23 Oct 2021 - 16:48

84

Views

Using complement to create a DFA with a specific condition

Published on 15 Nov 2021 - 22:38

163

Views

Regular expression for a language string

Published on 22 Nov 2021 - 5:04

1.3k

Views

is {w in {0,1}* | #0(w) = #1(w)} a regular language?

Published on 24 Nov 2021 - 11:08

264

Views

Regularity of a language checker

Published on 29 Nov 2021 - 6:54

232

Views

How to write a regular expression for the given language?

Published on 18 Dec 2021 - 6:06

31

Views

Write a regular expression over the given language.

Published on 18 Dec 2021 - 8:33

591

Views

intersection of two regular expressions

Published on 28 Feb 2022 - 3:30

168

Views

DFA conversion through state elimination and arden's method

Published on 03 Mar 2022 - 9:22

559

Views

$a^nb^n$ language vs $a^nb^m$

Published on 03 Mar 2022 - 21:40

List Question

regular expression and equivalent right linear grammar

How to write a regular expression for every string w over {0,1} where w is a binary string with value of at least 40.

Context Free Grammar for strings of $z^n$y$x^m$ $w^n$

If $$ is regular, will $L' = \{v\in L:\,\exists w\in L: w = v^R\}$ be regular also?

what is the most recommended book to learn automata and formal languages?

Regular Expressions and intersection.

Using complement to create a DFA with a specific condition

Regular expression for a language string

is {w in {0,1}* | #0(w) = #1(w)} a regular language?

Regularity of a language checker

How to write a regular expression for the given language?

Write a regular expression over the given language.

intersection of two regular expressions

DFA conversion through state elimination and arden's method

$a^nb^n$ language vs $a^nb^m$

Trending Questions

Popular # Hahtags

Popular Questions