—Due to its importance as a model for several software and hardware applications, automata theory is a core topic in computer science and engineering education. But because of its abstract mathematical nature automata is used to be taught by traditional lecture-driven style. Virtual reality and web-based learning can provide automata learners with a unique experience such as interactive learnin...

We present a theory for automata in HOL, which is dedicated towards formal hardware synthesis. The theory contains deenitions for formally representing and transforming automata. In this approach hardware is represented by automata descriptions and formal synthesis is performed by applying formally proven theorems. The approach presented is constructive | i.e. starting from speciications at hig...

We present a constructive formalization of the Myhill-Nerode theorem on the minimization of nite automata that follows the account in Hopcroft and Ullman's book Formal Languages and Their Relation to Automata. We chose to formalize this theorem because it illustrates many points critical to formalization of computational mathematics, especially the extraction of an important algorithm from a pr...

Determinism of devices is a key aspect throughout all of computer science, simply because of considerations of efficiency of the implementation. One possible way (among others) to relax this notion is to consider unambiguous machines: non-deterministic machines that have at most one accepting run on each input. In this paper, we will investigate the nature of unambiguity in automata theory, pre...

We describe here a development in the system Coq of a piece of Finite Automata Theory. The main result is the Kleene's theorem, expressing that regular expressions and nite automata deene the same languages. From a constructive proof of this result, we automatically obtain a functional program that compiles any regular expression into a nite automata, which constitutes the main part of the impl...

In contrast to qualitative linear temporal logics, which can be used to state that some property will eventually be satisfied, metric temporal logics allow to formulate constraints on how long it may take until the property is satisfied. While most of the work on combining Description Logics (DLs) with temporal logics has concentrated on qualitative temporal logics, there has recently been a gr...