Using synchronizing heuristics for generating UIO sequences

2018-2019 Fall
Faculty Department of Project Supervisor: 
Faculty of Engineering and Natural Sciences
Number of Students: 

In this project, we will carry out a research project on automata and finite state machines, which are used as formal notations to model the behavior of systems at an abstract level. Based on the analysis of these formal models, one can derive tests for the implementations of the systems. The work requires a basic understanding of automata theory, graph theory, and implementation of graph-theoretic algorithms.

Related Areas of Project: 
Computer Science and Engineering
Electronics Engineering

About Project Supervisors

Please see for publications related to the topic of this project.