Question

Interesting formal languages proof.

score 91 · Answer 1 · 2018-08-25 18:14:00

91

Views

Interesting formal languages proof.

Published on 25 Aug 2018 - 18:14

score 648 · Answer 2 · 2018-08-28 22:22:26

648

Views

Inductive Proof of a property of String concatenation

Published on 28 Aug 2018 - 22:22

score 399 · Answer 3 · 2026-03-25 17:19:23

399

Views

Are all computing languages restricted to primitive recursive functions capable of modeling each other?

Published on 25 Mar 2026 - 17:19

score 98 · Answer 4 · 2026-03-25 15:56:54

98

Views

How to find a simple function in Lambda Calculus?

Published on 25 Mar 2026 - 15:56

score 37 · Answer 5 · 2018-09-12 18:33:57

37

Views

How to write formal languages for sets $A^2$ and $B^2$?

Published on 12 Sep 2018 - 18:33

score 39 · Answer 6 · 2026-03-25 01:24:02

39

Views

Deciding on claims to prove grammar

Published on 25 Mar 2026 - 1:24

score 212 · Answer 7 · 2026-03-25 09:33:15

212

Views

square-free word

Published on 25 Mar 2026 - 9:33

score 148 · Answer 8 · 2026-03-25 12:16:18

148

Views

Write a procedure to demonstrate that $L$ is recursively enumerable.

Published on 25 Mar 2026 - 12:16

score 287 · Answer 9 · 2026-03-25 09:48:23

287

Views

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

Published on 25 Mar 2026 - 9:48

score 42 · Answer 10 · 2026-03-25 04:38:29

42

Views

What is open first in formal languages

Published on 25 Mar 2026 - 4:38

score 63 · Answer 11 · 2026-03-25 04:37:23

63

Views

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

Published on 25 Mar 2026 - 4:37

score 306 · Answer 12 · 2026-03-25 04:35:13

306

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 25 Mar 2026 - 4:35

score 943 · Answer 13 · 2026-03-22 13:24:00

943

Views

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

Published on 22 Mar 2026 - 13:24

score 104 · Answer 14 · 2026-03-25 09:15:31

104

Views

Does {a} \ {a} give an Ɛ in formal languages and automata?

Published on 25 Mar 2026 - 9:15

score 23 · Answer 15 · 2018-09-27 20:01:17

23

Views

When given a language, does the algebra follow when raising a symbol in the alphabet to 0 or a negative number?

Published on 27 Sep 2018 - 20:01

List Question

Interesting formal languages proof.

Inductive Proof of a property of String concatenation

Are all computing languages restricted to primitive recursive functions capable of modeling each other?

How to find a simple function in Lambda Calculus?

How to write formal languages for sets $A^2$ and $B^2$?

Deciding on claims to prove grammar

square-free word

Write a procedure to demonstrate that $L$ is recursively enumerable.

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.

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?

Does {a} \ {a} give an Ɛ in formal languages and automata?

When given a language, does the algebra follow when raising a symbol in the alphabet to 0 or a negative number?

Trending Questions

Popular # Hahtags

Popular Questions