AbstractSymbolic sequences uniquely reconstructible from all their substrings of length k compose a regular factorial language. We thoroughly characterize this language by its minimal forbidden words, and explicitly build up a deterministic finite automaton that accepts it. This provides an efficient on-line algorithm for testing the unique reconstructibility of the sequences
Abstract. We propose and evaluate a new algorithm for checking the universality of nondeterministic ...
AbstractWe investigate the descriptional complexity of the nondeterministic finite automaton (NFA) t...
The upper semilattice of degrees of transformability by finite-state automata is defined analogously...
AbstractSymbolic sequences uniquely reconstructible from all their substrings of length k compose a ...
We show that every regular language defines a unique nondeterministic finite automaton (NFA), which ...
The minimal deterministic finite automaton is generally used to determine regular languages equalit...
Abstract. We show that every regular language defines a unique non-deterministic finite automaton (N...
AbstractWe give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of c...
We give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant ...
Abstract: A general way to find repetitions of factors in a given text is shown. We start with a cla...
Abstract. In this paper we consider non-deterministic finite Rabin–Scott’s automata. We obtain some ...
AbstractLearning regular languages from queries was introduced by Angluin in a seminal paper that al...
This paper aims at introducing finite automata theory, the different ways to describe regular langua...
\u3cp\u3eFailure deterministic finite automata (FDFAs) represent regular languages more compactly th...
Abstract. We propose and evaluate a new algorithm for checking the universality of nondeterministic ...
AbstractWe investigate the descriptional complexity of the nondeterministic finite automaton (NFA) t...
The upper semilattice of degrees of transformability by finite-state automata is defined analogously...
AbstractSymbolic sequences uniquely reconstructible from all their substrings of length k compose a ...
We show that every regular language defines a unique nondeterministic finite automaton (NFA), which ...
The minimal deterministic finite automaton is generally used to determine regular languages equalit...
Abstract. We show that every regular language defines a unique non-deterministic finite automaton (N...
AbstractWe give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of c...
We give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant ...
Abstract: A general way to find repetitions of factors in a given text is shown. We start with a cla...
Abstract. In this paper we consider non-deterministic finite Rabin–Scott’s automata. We obtain some ...
AbstractLearning regular languages from queries was introduced by Angluin in a seminal paper that al...
This paper aims at introducing finite automata theory, the different ways to describe regular langua...
\u3cp\u3eFailure deterministic finite automata (FDFAs) represent regular languages more compactly th...
Abstract. We propose and evaluate a new algorithm for checking the universality of nondeterministic ...
AbstractWe investigate the descriptional complexity of the nondeterministic finite automaton (NFA) t...
The upper semilattice of degrees of transformability by finite-state automata is defined analogously...
DOI
Add to ORKG