List questions from formal-languages

Published on 01 Aug 2015 - 1:08

280

Views

Math replacing natural language

Published on 25 Mar 2026 - 22:24

429

Views

$F[t]$ has undecidable positive existential theory in the language $\{+, \cdot , 0, 1, t\}$

Published on 02 Aug 2015 - 15:06

500

Views

Set of all factors of regular language regular?

Published on 26 Mar 2026 - 1:10

51

Views

Inequality for the set of factors of length $n$ of some regular language

Published on 25 Mar 2026 - 23:40

19

Views

Why $H_{V^* \cup W^*} > H_{V \cup W}$ if $H_V$ denotes entropy of language

Published on 29 Mar 2026 - 15:43

86

Views

Prove that $R_1 \times R_2$ is a regular language for $R_1, R_2$ regular

Published on 27 Mar 2026 - 0:06

331

Views

examples of "interesting" star-free languages

Published on 26 Mar 2026 - 22:13

868

Views

Proof that Deterministic Context-free languages (DCFL) is closed under complementation

Published on 12 Aug 2015 - 15:51

225

Views

Why is there a $p\in \mathbb{N}$ such that $mr - p < \frac{1}{10}$?

Published on 18 Aug 2015 - 1:55

57

Views

Why does this equivalence stand?

Published on 18 Aug 2015 - 12:33

42

Views

How can a structure for a formal language be defined?

Published on 18 Aug 2015 - 14:12

44

Views

Show that there is such an algorithm

Published on 23 Aug 2015 - 19:45

1.3k

Views

Lambda and concatenation of languages.

Published on 27 Aug 2015 - 14:21

239

Views

Is there a notation for "Bounded Kleene star"?

Published on 28 Aug 2015 - 20:28

List Question

Algorithm to answer existential questions - Reduction

Math replacing natural language

$F[t]$ has undecidable positive existential theory in the language $\{+, \cdot , 0, 1, t\}$

Set of all factors of regular language regular?

Inequality for the set of factors of length $n$ of some regular language

Why $H_{V^* \cup W^*} > H_{V \cup W}$ if $H_V$ denotes entropy of language

Prove that $R_1 \times R_2$ is a regular language for $R_1, R_2$ regular

examples of "interesting" star-free languages

Proof that Deterministic Context-free languages (DCFL) is closed under complementation

Why is there a $p\in \mathbb{N}$ such that $mr - p < \frac{1}{10}$?

Why does this equivalence stand?

How can a structure for a formal language be defined?

Show that there is such an algorithm

Lambda and concatenation of languages.

Is there a notation for "Bounded Kleene star"?

Trending Questions

Popular # Hahtags

Popular Questions