Possible edges of a finite automaton defining a given regular language

Authors:
B. F. Melnikov;N. V. Sciarini-Guryanova
Affiliations:
Department of Information Technologies, Simbirsk State University, L.Tolstoy str., 42, Simbirsk (Ulyanovsk), Russia;Department of Linguistics, Simbirsk State University, L.Tolstoy Str., 42, Simbirsk (Ulyanovsk), Russia
Venue:
The Korean Journal of Computational & Applied Mathematics
Year:
2002

Citing 0
Cited 5

Some properties of the basis finite automaton

The Korean Journal of Computational & Applied Mathematics
Discrete Optimization Problems - Some New Heuristic Approaches

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
On an expansion of nondeterministic finite automata

Journal of Applied Mathematics and Computing
Extended Nondeterministic Finite Automata

Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov
Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems

Fundamenta Informaticae - Hardest Boolean Functions and O.B. Lupanov

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider non-deterministic finite Rabin-Scott's automata. We define special abstract objects, being pairs of values of states-marking functions. On the basis of these objects as the states of automaton, we define its edges; the obtained structure is considered also as a nondeterministic automaton. We prove, that any edge of any nondeterministic automaton defining the given regular language can be obtained by such techniques. Such structure can be used for solving various problems in the frames of finite automata theory.