The regulator theory for finite automata

Finite Automata Theory in

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...

Applications of Algebraic Automata Theory to Quantum Finite Automata

The computational model of Quantum Finite Automata has been introduced by multiple authors (e.g. [38, 44]) with some variations in definition. The objective of this thesis is to understand what class of languages can be recognized by these different variations, and how many states are required. We begin by showing that we can use algebraic automata theory to characterize the language recognitio...

Multidimensional fuzzy finite tree automata

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

Finite Automata

• F ⊆ Q is the set of accept or final states. The behavior of a DFA M on an input string x ∈ Σ∗ is as follows. It reads the symbols in x one at a time, from left to right. At each point in time, the automaton has a current state. Initially, the automaton is in state s. If the current state of the automaton is q, and the next symbol in x to be read is a, then the automaton on reading a transitio...

Finite Automata