One implementation of PL prover algorithm
Tatjana Timotijević (2001)
Kragujevac Journal of Mathematics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Tatjana Timotijević (2001)
Kragujevac Journal of Mathematics
Similarity:
Jan Vinař (1966)
Kybernetika
Similarity:
Manuel Delgado (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Natural algorithms to compute rational expressions for recognizable languages, even those which work well in practice, may produce very long expressions. So, aiming towards the computation of the commutative image of a recognizable language, one should avoid passing through an expression produced this way. We modify here one of those algorithms in order to compute directly a semilinear expression for the commutative image of a recognizable language. We also give a second modification...
Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre (2009)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We present an on-line linear time and space algorithm to check if an integer array is the border array of at least one string built on a bounded or unbounded size alphabet . First of all, we show a bijection between the border array of a string and the skeleton of the DFA recognizing , called a string matching automaton (SMA). Different strings can have the same border array but the originality of the presented method is that the correspondence between a border array and a skeleton...