List questions from formal-languages

Published on 27 Mar 2026 - 2:22

1.1k

Views

Set builder form for representing strings

Published on 22 Dec 2014 - 14:10

184

Views

Given a set of integers and operators, find if number is obtainable

Published on 23 Dec 2014 - 1:09

1k

Views

Mathematical structures of language (Zellig Harris)

Published on 26 Dec 2014 - 16:13

418

Views

Abstract alphabets by Kolmogorov??

Published on 26 Dec 2014 - 18:41

164

Views

Unique factorization in human language? (Kummer rings at stake?)

Published on 26 Dec 2014 - 21:32

1.6k

Views

Is the complement of {(a^nb^n)^m | n>0,m>0} context-free?

Published on 25 Mar 2026 - 17:38

300

Views

Convergence and Crash of a derivation (Chomsky)

Published on 27 Dec 2014 - 15:51

121

Views

Riesz-Fischer Theorem applications in language?

Published on 30 Dec 2014 - 18:57

3.1k

Views

Proper suffix, suffix and empty string

Published on 05 Oct 2019 - 19:37

392

Views

I can't understand how can there be languages of infinite size yet containing only words of finite length.

Published on 15 Mar 2026 - 22:30

108

Views

Proof with induction even number of letter

Published on 12 Oct 2019 - 10:14

95

Views

How to check if language transformer function is regular or not?

Published on 26 Mar 2026 - 18:30

122

Views

Given $f(A) = \{ac \mid abc \in A \ and \ |a| = |b| = |c|\}$, why is $f(L)$ not regular if $L$ is a regular language?

Published on 26 Mar 2026 - 18:40

546

Views

Does there exist an L-system for the sierpiński curve

Published on 14 Oct 2019 - 9:43

List Question

Context free grammar to NFA

Set builder form for representing strings

Given a set of integers and operators, find if number is obtainable

Mathematical structures of language (Zellig Harris)

Abstract alphabets by Kolmogorov??

Unique factorization in human language? (Kummer rings at stake?)

Is the complement of {(a^nb^n)^m | n>0,m>0} context-free?

Convergence and Crash of a derivation (Chomsky)

Riesz-Fischer Theorem applications in language?

Proper suffix, suffix and empty string

I can't understand how can there be languages of infinite size yet containing only words of finite length.

Proof with induction even number of letter

How to check if language transformer function is regular or not?

Given $f(A) = \{ac \mid abc \in A \ and \ |a| = |b| = |c|\}$, why is $f(L)$ not regular if $L$ is a regular language?

Does there exist an L-system for the sierpiński curve

Trending Questions

Popular # Hahtags

Popular Questions