Add to ORKGAbstract. We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characterization result, we obtain a canonical representation for any DMA-recognizable language. We then show that this canonical automaton is minimal in a strong sense: it has the minimal number of control states and also the minimal amount of internal storage.
The present paper establishes the learnability of simple deterministic finite-memory automata via me...
In this paper, we present a taxonomy of algorithms for constructing minimal acyclic deterministic fi...
AbstractWe prove that every FTR-language R (factorial, transitive, rational) admits a minimal irredu...
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by...
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by...
Abstract. The relationship between automata and logics has been in-vestigated since the 1960s. In pa...
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
Abstract. A cover-automaton A of a nite language L is a nite automaton that accepts all words in ...
International audienceWe see data words as sequences of letters with additional edges that connect p...
Extremal minimality conditions on automata. (English summary) Theoret. Comput. Sci. 440/441 (2012), ...
Abstract. We see data words as sequences of letters with additional edges that connect pairs of posi...
International audienceThis paper presents the model of Layered Memory Automata (LaMA) to deal with l...
The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object f...
In this paper we study the problem of minimising deterministic automata over finite and infinite wor...
Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, re...
The present paper establishes the learnability of simple deterministic finite-memory automata via me...
In this paper, we present a taxonomy of algorithms for constructing minimal acyclic deterministic fi...
AbstractWe prove that every FTR-language R (factorial, transitive, rational) admits a minimal irredu...
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by...
We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by...
Abstract. The relationship between automata and logics has been in-vestigated since the 1960s. In pa...
AbstractBideterministic automata are deterministic automata with the property of their reversal auto...
Abstract. A cover-automaton A of a nite language L is a nite automaton that accepts all words in ...
International audienceWe see data words as sequences of letters with additional edges that connect p...
Extremal minimality conditions on automata. (English summary) Theoret. Comput. Sci. 440/441 (2012), ...
Abstract. We see data words as sequences of letters with additional edges that connect pairs of posi...
International audienceThis paper presents the model of Layered Memory Automata (LaMA) to deal with l...
The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object f...
In this paper we study the problem of minimising deterministic automata over finite and infinite wor...
Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, re...
The present paper establishes the learnability of simple deterministic finite-memory automata via me...
In this paper, we present a taxonomy of algorithms for constructing minimal acyclic deterministic fi...
AbstractWe prove that every FTR-language R (factorial, transitive, rational) admits a minimal irredu...