Corpus ID: 17248455

The universal automaton

@inproceedings{Lombardy2008TheUA,
  title={The universal automaton},
  author={Sylvain Lombardy and Jacques Sakarovitch},
  booktitle={Logic and Automata},
  year={2008}
}
This paper is a survey on the universal automaton, which is an automaton canonically associated with every language. In the last forty years, many objects have been defined or studied, that are indeed closely related to the universal automaton. We first show that every automaton that accepts a given language has a morphic image which is a subautomaton of the universal automaton of this language. This property justifies the name “universal” that we have coined for this automaton. The universal… Expand
The complete finite automaton
There is well-known, that for the description of a regular language, there are different complete invariants: not only well-known canonical automata, but also basis automata and universal automata.Expand
An approach to the classification of the loops of finite automata. Part i: long corresponding loops
TLDR
The hypothesis is formulated that if for any state of the considered nondeterministic automaton, there exists at least one correspondingState of the basis Automaton, such that the first one is a complete cyclic state for the second one, then all the corresponding states of the based automaton are such ones. Expand
An approach to the classification of the loops of finite automata. Part II: The classification of the states based on the loops
TLDR
The hypothesis is formulated that if for any state of the considered nondeterministic automaton, there exists at least one correspondingState of the basis automaton such that the first one is a complete cyclic state for the second one, then all the corresponding states of the based automaton are such ones. Expand
The universal fuzzy automaton
TLDR
The homomorphism of fuzzy automata is defined, and it is proved that every automaton accepting a fuzzy language can canonically map into the universal fuzzy automaton of this language, which is called the universal property. Expand
Waterloo-like finite automata and algorithms for their automatic construction
TLDR
An example of algorithm for the transformation of so-called complete automaton given by a table of binary relation #, which gives the opportunity to build on the basis of the given relation # some automaton which also has the walibad-property. Expand
Minimization of Automata
TLDR
This chapter describes the minimization algorithm by fusion for so-called local automata, and considers the case of updating a minimal automaton when a word is added or removed from the set it recognizes. Expand
The syntactic concept lattice: Another algebraic theory of the context-free languages?
TLDR
It is claimed that grammars that are minimal, in a certain weak sense, will always have nonterminals that correspond to elements of this lattice, and that the syntactic concept lattice provides a natural system of categories for representing the denotations of context-free Grammars. Expand
Coalgebraic constructions of canonical nondeterministic automata
TLDR
This work recovers three well-studied canonical nfas and obtains a new canonical nfa called the distromaton by taking V = distributive lattices, which is shown to be minimal relative to a suitable measure. Expand
Three Learnable Models for the Description of Language
TLDR
This work defines context free grammars where the non-terminals of the grammar correspond to the syntactic congruence classes, and a residuated lattice structure from the Galois connection between strings and contexts is defined, which allows a class of languages that includes some non-context free languages, many context-free languages and all regular languages. Expand
Theory of átomata
We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "atomaton", whose states are the "atoms" of the language, that is, non-empty intersectionsExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
Star Height of Reversible Languages and Universal Automata
TLDR
It is shown that the universal automaton of a reversible language contains a subautomaton where the star height can be computed, and is based upon the definition of an automaton that is effectively associated to every language and that contains the image of any Automaton that accepts the language. Expand
On the Size of the Universal Automaton of a Regular Language
TLDR
The universal automaton of a regular language is the maximal NFA without merging states that recognizes this language and it is proved that a tight bound on its size with respect to the size of the smallest equivalent NFA is given by Dedekind's numbers. Expand
On Reversible Automata
  • J. Pin
  • Mathematics, Computer Science
  • LATIN
  • 1992
TLDR
Four non-trivial characterizations of the languages accepted by a reversible automaton equipped with a set of initial and final states are given and it is shown that one can effectively decide whether a given rational (or regular) language can be accepted by the automaton. Expand
On the Construction of Reversible Automata for Reversible Languages
TLDR
This paper gives in this paper a method to compute a reversible automaton from the minimal automaton of a reversible language that contains an equivalent automaton which is quasi-reversible. Expand
On the State Minimization of Nondeterministic Finite Automata
The aim of this paper is to obtain a procedure for finding a minimum state nondeterministic finite automaton (NDA) equivalent to a given (in general, nondeterministic) finite automaton. Given aExpand
Minimalizations of NFA using the universal automaton
  • L. Polák
  • Computer Science, Mathematics
  • Int. J. Found. Comput. Sci.
  • 2005
TLDR
This work explores and compares various conditions on sets of states of which are related to the fact that induced subautomata of accept the whole language L, and proposes a new algorithm which is easy to implement. Expand
A geometrical view of the determinization and minimization of finite-state automata
TLDR
It is shown that the determinization and the minimization of these automata correspond to simple geometrical reorganizations of the rectangular decompositions of the associated relations. Expand
On a Maximal NFA Without Mergible States
TLDR
It is shown that the maximal possible number of non-mergible states in a NFA that accepts a given regular language L is not greater than 2n – 1, where n is the number of states in the minimal deterministic finite automaton that accepts L. Expand
Representation Theorems on Regular Languages
  • K. Hashiguchi
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1983
TLDR
It is shown that there exist algorithms for deciding whether or not an arbitrary regular language has a Ω-representation over an arbitrary class C of regular languages for any subset Ω of T. Expand
Algorithms for Determining Relative Star height and Star Height
Eggan(l963) introduced the notion of the star height to each regular expression which is a nonnegative integer denoting the nestedness of star operators in this expression. The star height of aExpand
...
1
2
3
4
...