Homework 1
This homework is designed to make you engage with the regular language portion of this course. It is due in two weeks (on Friday, ), electronically, or if necessary in my mailbox.
Guidelines
Feel free to work together as much as you’d like. However, if you work together with someone else , each of you must write up their own homework. Furthermore, please include the names of all people you worked together with, in the homework.
Assignment
Give a minimalist grammar lexicon for the language of the regular expression \(10^{\ast}1\). Do this in the following steps:
- construct a finite automaton recognizing this language (using either the derivative operation or the Myhill-Nerode equivalence relation)
- interpret the transitions and final states of the automaton as lexical items
- it will be convenient to rename the states (using something simple, like letters, or numbers)
- final states are interpreted as lexical items which are pronounced as the empty string