A probabilistic analysis of a new satisfiability algorithm
B. Apolloni, S. Di Gregorio (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Computing -free NFA from regular expressions in time”
A probabilistic analysis of a new satisfiability algorithm
Construction of a deterministic -automaton using derivatives
Roman R. Redziejowski (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Complexity of E0L structural equivalence
Kai Salomaa, Derick Wood, Sheng Yu (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Parallel computation on 2-3-trees
W. Paul, U. Vishkin, H. Wagener (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Prolog infinite trees and automata
Solange Coupet-Grimal (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On context constrained squares and repetitions in a string
A. Apostolico (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Systolic tree acceptors
Karel Ii Culik, Arto Salomaa, Derick Wood (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: