Javascript is currently not supported, or is disabled by this browser. Please enable Javascript for full functionality.

Skip to main content
Ontario Tech acknowledges the lands and people of the Mississaugas of Scugog Island First Nation.

We are thankful to be welcome on these lands in friendship. The lands we are situated on are covered by the Williams Treaties and are the traditional territory of the Mississaugas, a branch of the greater Anishinaabeg Nation, including Algonquin, Ojibway, Odawa and Pottawatomi. These lands remain home to many Indigenous nations and peoples.

We acknowledge this land out of respect for the Indigenous nations who have cared for Turtle Island, also called North America, from before the arrival of settler peoples until this day. Most importantly, we acknowledge that the history of these lands has been tainted by poor treatment and a lack of friendship with the First Nations who call them home.

This history is something we are all affected by because we are all treaty people in Canada. We all have a shared history to reflect on, and each of us is affected by this history in different ways. Our past defines our present, but if we move forward as friends and allies, then it does not have to define our future.

Learn more about Indigenous Education and Cultural Services

    Apr 17, 2021  
2017-2018 Graduate Academic Calendar 
2017-2018 Graduate Academic Calendar [ARCHIVED CALENDAR]

Add to favourites (opens a new window)

CSCI 5030G - Automata and Applications

This course studies the theories of various types of automata and their applications. Regular automata, Büchi automata, pushdown automata and finally tree automata are covered. Students discuss the respective formal languages and the fundamental theorems such as closure theorems and different versions of Nerode equivalences. The second part of the course discusses the applications of automata in selected areas of compilers, natural language processing, information retrieval, type checking of programs, composition of services and temporal logic reasoning.
Credit hours: 3
Prerequisite(s): Undergraduate courses in Discrete Mathematics, Algebra and Computational Complexity.

Add to favourites (opens a new window)