The branching nerve of HDA and the Kan condition.
The category of Pawlak machines
The closure under division and a characterization of the recognizable -subsets
The completely distributive lattice of machine invariant sets of infinite words
We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. The length and width of it is c. We show the subword complexity and the growth function create machine invariant classes.
The connection between a (3,2)-semigroup automaton and a semigroup automaton
The globals of pseudovarieties of ordered semigroups containing and an application to a problem proposed by Pin
Given a basis of pseudoidentities for a pseudovariety of ordered semigroups containing the 5-element aperiodic Brandt semigroup , under the natural order, it is shown that the same basis, over the most general graph over which it can be read, defines the global. This is used to show that the global of the pseudovariety of level of Straubing-Thérien’s concatenation hierarchy has infinite vertex rank.
The globals of pseudovarieties of ordered semigroups containing B2 and an application to a problem proposed by Pin
Given a basis of pseudoidentities for a pseudovariety of ordered semigroups containing the 5-element aperiodic Brandt semigroup B2, under the natural order, it is shown that the same basis, over the most general graph over which it can be read, defines the global. This is used to show that the global of the pseudovariety of level 3/2 of Straubing-Thérien's concatenation hierarchy has infinite vertex rank.
The inverse semigroup of a sumordered semiring.
The lattice of subautomata of an automaton: A survey.
The lattice of varieties of fibered automata
The class of all fibered automata is a variety of two-sorted algebras. This paper provides a full description of the lattice of varieties of fibred automata.
The pseudovariety is hyperdecidable
The pseudovariety of semigroups of triangular matrices over a finite field
We show that semigroups representable by triangular matrices over a fixed finite field form a decidable pseudovariety and provide a finite pseudoidentity basis for it.
The pseudovariety of semigroups of triangular matrices over a finite field
We show that semigroups representable by triangular matrices over a fixed finite field form a decidable pseudovariety and provide a finite pseudoidentity basis for it.
The semigroup of a strongly connected automaton.
The variety generated by finite nilpotent monoids.
Transcendence, automata theory and gamma functions for polynomial rings
Translation from classical two-way automata to pebble two-way automata
We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata equipped with some additional “pebbles” that are movable along the input tape, but their use is restricted (nested) in a stack-like fashion. Similarly as in the case of the classical two-way machines, it is not known whether there exists a polynomial trade-off, in the number of states, between the nondeterministic and deterministic two-way automata with nested pebbles. However,...
Translation from classical two-way automata to pebble two-way automata
We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata equipped with some additional “pebbles” that are movable along the input tape, but their use is restricted (nested) in a stack-like fashion. Similarly as in the case of the classical two-way machines, it is not known whether there exists a polynomial trade-off, in the number of states, between the nondeterministic and deterministic two-way automata with nested pebbles. However,...
Tree transformations defined by hypersubstitutions
Tree transducers are systems which transform trees into trees just as automata transform strings into strings. They produce transformations, i.e. sets consisting of pairs of trees where the first components are trees belonging to a first language and the second components belong to a second language. In this paper we consider hypersubstitutions, i.e. mappings which map operation symbols of the first language into terms of the second one and tree transformations defined by such hypersubstitutions....