Prolog infinite trees and automata
Solange Coupet-Grimal (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Solange Coupet-Grimal (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
D. Derencourt, J. Karhumäki, M. Latteux, A. Terlutte (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Milan Šimánek (2002)
Kybernetika
Similarity:
This paper concerns searching substrings in a string using the factor automaton. The factor automaton is a deterministic finite automaton constructed to accept every substring of the given string. Nondeterministic factor automaton is used to achieve new operations on factor automata for searching in non-constant texts.
Sylvain Lombardy, Jacques Sakarovitch (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
In this paper we investigate how it is possible to recover an automaton from a rational expression that has been computed from that automaton. The notion of derived term of an expression, introduced by Antimirov, appears to be instrumental in this problem. The second important ingredient is the co-minimization of an automaton, a dual and generalized Moore algorithm on non-deterministic automata. We show here that if an automaton is then sufficiently “decorated”, the combination of these...
Karel Culik II, Juhani Karhumäki (1990)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
I. H. Sudborough (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: