AbstractDiverse problems ranging from many-valued logics to finite automata can be expressed as questions concerning compositions of functions over a finite domain. We develop a theory dealing with the depth and complete depth of such functions. Interconnections with synchronizable finite automata are also discussed. Many of the very basic problems turn out to be NP-hard. Also several open problems are pointed out
AbstractSymbolic sequences uniquely reconstructible from all their substrings of length k compose a ...
We consider a set of eight natural operations on formal languages (Kleene closure, positive closure,...
We prove that the finite representation property holds for representation by partial functions for t...
AbstractDiverse problems ranging from many-valued logics to finite automata can be expressed as ques...
The problem about the synchronization of a finite deterministic automaton is not yet properly unders...
AbstractWe exhibit a finite family of functions over a finite set (i.e. a finite algebra), such that...
Abstract We show that a special case of the Feferman-Vaught composition theorem gives rise to a natu...
This thesis presents new algorithm for complement of nondeterministic finite automata. State-of-the-...
summary:We present an overview of four approaches of the finite automata use in stringology: determi...
A certain class of composite binary automata with strongly connected component automata is studied. ...
Introduction Let D be some finite alphabet of symbols, (a set of "digits"). A numeration ...
AbstractA finite automaton with multiplication (FAM) is a finite automaton with a register which is ...
International audienceOpen Automata (OA) are symbolic and parameterized models for open concurrent s...
This paper is a note on how Information Theory and Codification Theory are helpful in the computatio...
We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and M...
AbstractSymbolic sequences uniquely reconstructible from all their substrings of length k compose a ...
We consider a set of eight natural operations on formal languages (Kleene closure, positive closure,...
We prove that the finite representation property holds for representation by partial functions for t...
AbstractDiverse problems ranging from many-valued logics to finite automata can be expressed as ques...
The problem about the synchronization of a finite deterministic automaton is not yet properly unders...
AbstractWe exhibit a finite family of functions over a finite set (i.e. a finite algebra), such that...
Abstract We show that a special case of the Feferman-Vaught composition theorem gives rise to a natu...
This thesis presents new algorithm for complement of nondeterministic finite automata. State-of-the-...
summary:We present an overview of four approaches of the finite automata use in stringology: determi...
A certain class of composite binary automata with strongly connected component automata is studied. ...
Introduction Let D be some finite alphabet of symbols, (a set of "digits"). A numeration ...
AbstractA finite automaton with multiplication (FAM) is a finite automaton with a register which is ...
International audienceOpen Automata (OA) are symbolic and parameterized models for open concurrent s...
This paper is a note on how Information Theory and Codification Theory are helpful in the computatio...
We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and M...
AbstractSymbolic sequences uniquely reconstructible from all their substrings of length k compose a ...
We consider a set of eight natural operations on formal languages (Kleene closure, positive closure,...
We prove that the finite representation property holds for representation by partial functions for t...
DOI
Add to ORKG