One challenge in making online education more effective is to develop automatic grading software that can provide meaningful feedback. This paper provides a solution to automatic grading of theâ€¦ (More)

The reachability problem for timed automata asks if there exists a path from an initial state to a target state. The standard solution to this problem involves computing the zone graph of theâ€¦ (More)

In computer-aided education, the goal of automatic feedback is to provide a meaningful explanation of students' mistakes. We focus on providing feedback for constructing a deterministic finiteâ€¦ (More)

Several applications including text-to-speech require some normalized format of non-standard words in various domains such as numbers, dates, and currencies and in various human languages. Theâ€¦ (More)

LTL\GU is a fragment of linear temporal logic (LTL), where negations appear only on propositions, and formulas are built using the temporal operators X (next), F (eventually), G (always), and Uâ€¦ (More)

Given a PFA A and a cut-point Î», the isolation problem asks if there is a bound > 0 such that the acceptance probability of every word is bounded away from Î» by . In this paper we show that theâ€¦ (More)

A crucial step in model checking Markov Decision Processes (MDP) is to translate the LTL specification into automata. Efforts have been made in improving deterministic automata construction for LTLâ€¦ (More)

The reachability problem for timed automata refers to deciding if there exists a path from its initial state to a given target state. We propose a new algorithm for this problem. The first solutionâ€¦ (More)