Topics
automatonBook
The existence of atoms of automaton reducibility degrees structure with essential different properties is proved. In the proof the priority method from the theory of recursive funtions was used
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
Abstract. We show that every regular language defines a unique non-deterministic finite automaton (N...
We identify a notion of reducibility between predicates, called instancereducibility, which commonly...
The existence of atoms of automaton reducibility degrees structure with essential different properti...
© 2016, Allerton Press, Inc.We show that the set of prefix decidable superwords is closed under fini...
In this paper we prove that the set of degrees of asynchronously automaton transformations of infini...
The upper semilattice of degrees of transformability by finite-state automata is defined analogously...
© 2016, Allerton Press, Inc.We show that the structure of degrees of finite automaton transformation...
In this paper we study a partially ordered set of degrees of asynchronously automaton transformation...
We study finite-state transducers and their power for transforming infinite words. Infinite sequence...
We study finite-state transducers and their power for transforming infinite words. Infinite sequence...
Many relational structures are automatically presentable, i.e. elements of the domain can be seen as...
Our objects of study are infinite sequences and how they can be transformed into each other. As tran...
We consider in this paper the basis finite automaton and its some properties. We shall also consider...
These notes form the core of a future book on the algebraic foundations of automata theory. This boo...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
Abstract. We show that every regular language defines a unique non-deterministic finite automaton (N...
We identify a notion of reducibility between predicates, called instancereducibility, which commonly...
The existence of atoms of automaton reducibility degrees structure with essential different properti...
© 2016, Allerton Press, Inc.We show that the set of prefix decidable superwords is closed under fini...
In this paper we prove that the set of degrees of asynchronously automaton transformations of infini...
The upper semilattice of degrees of transformability by finite-state automata is defined analogously...
© 2016, Allerton Press, Inc.We show that the structure of degrees of finite automaton transformation...
In this paper we study a partially ordered set of degrees of asynchronously automaton transformation...
We study finite-state transducers and their power for transforming infinite words. Infinite sequence...
We study finite-state transducers and their power for transforming infinite words. Infinite sequence...
Many relational structures are automatically presentable, i.e. elements of the domain can be seen as...
Our objects of study are infinite sequences and how they can be transformed into each other. As tran...
We consider in this paper the basis finite automaton and its some properties. We shall also consider...
These notes form the core of a future book on the algebraic foundations of automata theory. This boo...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
Abstract. We show that every regular language defines a unique non-deterministic finite automaton (N...
We identify a notion of reducibility between predicates, called instancereducibility, which commonly...
Add to ORKG