Question

iteration of two finite state automata is a finite state automaton

score 33 · Answer 1 · 2022-07-16 22:12:33

33

Views

iteration of two finite state automata is a finite state automaton

Published on 16 Jul 2022 - 22:12

score 30 · Answer 2 · 2026-03-28 17:25:43

30

Views

Substitution of a letter with a regular expressions in regular expressions identities

Published on 28 Mar 2026 - 17:25

score 81 · Answer 3 · 2026-04-03 04:20:34

81

Views

Determine if a language is regular or not. Don't know how to start to prove.

Published on 03 Apr 2026 - 4:20

score 37 · Answer 4 · 2026-03-25 21:49:56

37

Views

When I use the Pumping Lemma from Automata Theory, what are my restrictions for "i"?

Published on 25 Mar 2026 - 21:49

score 112 · Answer 5 · 2026-04-03 04:21:02

112

Views

How do I approach: Prove that L is regular, where L ={s $\epsilon$ {a,b}*| $\forall$ prefix $w$ of $s$ it is true that $| |w|_a -|w|_b | \leq$2 }

Published on 03 Apr 2026 - 4:21

score 103 · Answer 6 · 2022-08-25 16:07:55

103

Views

What is the continuous analogue of a discrete finite automaton?

Published on 25 Aug 2022 - 16:07

score 54 · Answer 7 · 2026-03-30 10:14:39

54

Views

About the cases in the proof for Stallings automaton completness for a f.g. subgroup H of a free group F

Published on 30 Mar 2026 - 10:14

score 70 · Answer 8 · 2022-09-08 14:13:41

70

Views

Reading material and Practice Questions for Recursive Definitions of Languages

Published on 08 Sep 2022 - 14:13

score 183 · Answer 9 · 2026-04-04 12:37:06

183

Views

Give a recursive definition of the following language

Published on 04 Apr 2026 - 12:37

score 163 · Answer 10 · 2026-04-03 04:24:17

163

Views

I'm trying to convert an NFA to a DFA and I am getting very confused at a certain point. I don't think what I have is right.

Published on 03 Apr 2026 - 4:24

score 53 · Answer 11 · 2026-02-24 05:24:49

53

Views

Is the following grammar a CFG?

Published on 24 Feb 2026 - 5:24

score 226 · Answer 12 · 2026-04-03 04:17:27

226

Views

Prove that if $L$ is regular then $\mbox{Copy}(L)$ is regular

Published on 03 Apr 2026 - 4:17

score 221 · Answer 13 · 2022-10-08 20:35:37

221

Views

Proof of the property of Kleene star

Published on 08 Oct 2022 - 20:35

score 96 · Answer 14 · 2026-02-24 06:45:19

96

Views

Is the decision problem of compiling a program decidable?

Published on 24 Feb 2026 - 6:45

score 73 · Answer 15 · 2026-03-30 00:04:02

73

Views

Questions on Chomsky Normal Form Violations

Published on 30 Mar 2026 - 0:04

List Question

iteration of two finite state automata is a finite state automaton

Substitution of a letter with a regular expressions in regular expressions identities

Determine if a language is regular or not. Don't know how to start to prove.

When I use the Pumping Lemma from Automata Theory, what are my restrictions for "i"?

How do I approach: Prove that L is regular, where L ={s $\epsilon$ {a,b}*| $\forall$ prefix $w$ of $s$ it is true that $| |w|_a -|w|_b | \leq$2 }

What is the continuous analogue of a discrete finite automaton?

About the cases in the proof for Stallings automaton completness for a f.g. subgroup H of a free group F

Reading material and Practice Questions for Recursive Definitions of Languages

Give a recursive definition of the following language

I'm trying to convert an NFA to a DFA and I am getting very confused at a certain point. I don't think what I have is right.

Is the following grammar a CFG?

Prove that if $L$ is regular then $\mbox{Copy}(L)$ is regular

Proof of the property of Kleene star

Is the decision problem of compiling a program decidable?

Questions on Chomsky Normal Form Violations

Trending Questions

Popular # Hahtags

Popular Questions