Timeline for Describe construction of finite automata that accepts the language Double-Letter(L)
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 14, 2019 at 2:56 | comment | added | Breakpoint | @YuvalFilmus I thought the op was asking dfa just for double-letter(L). Now that I re read the question, what you said makes sense. | |
| Oct 14, 2019 at 0:02 | comment | added | Mandy | I was asking for a general way to construct a doubled language! that language I provided as example was just an example. | |
| Oct 13, 2019 at 20:14 | comment | added | Yuval Filmus | Your DFA doesn't depend on $L$ at all. | |
| Oct 13, 2019 at 19:46 | history | edited | Breakpoint | CC BY-SA 4.0 |
added 52 characters in body
|
| Oct 13, 2019 at 19:13 | history | answered | Breakpoint | CC BY-SA 4.0 |