Paper Info
Title
A Fast Algorithm to Decide on Simple Grammars Equivalence
Abstract
We present an algorithm to decide on simple grammars equivalence. Its complexity in time and space is polynomial in the valuation and the length of the description of the compared grammars, and exponential if we only take the last parameter into account. From this algorithm, we deduce an optimal upper bound of the number of parallel derivations to be applied to decide on equivalence.
Year
DOI
Venue
1989
10.1007/3-540-51859-2_8
Proceedings of the international symposium on Optimal algorithms
Keywords
Field
DocType
fast algorithm,upper bound
Rule-based machine translation,Discrete mathematics,Exponential function,Polynomial,Binary relation,Upper and lower bounds,Computer science,Spacetime,Algorithm,Equivalence (measure theory),Pushdown automaton
Conference
Volume
ISSN
ISBN
401
0302-9743
3-540-51859-2
Citations 
PageRank 
References 
7
1.15
10
Authors
1
Name
Order
Citations
PageRank
Didier Caucal147039.15