Class work #1 -- Deterministic Finite Automata

24 views

Skip to first unread message

Akif Eyler

unread,

Feb 18, 2019, 10:33:28 PM2/18/19

to BLM

Class work #1 -- bugün saat 13'e kadar buna cevap olarak gönderin:

1) How are these string concepts of Sec 1.5 implemented in JavaScript?

Alphabet, empty string, length, concatenation

2) Find an accepted string and a rejected string for the FA in Problem 2.2.11

3) Here is a model for L = (1+0)*10 = { w | binary w ends with 10 }

https://maeyler.github.io/Auto/work/DFA1.html

Modify the code and the web page for another DFA that you choose.

Yaptığınız değişiklikleri bir tek ekran resmi olarak göndereceksiniz.