Abstract
We give a polynomial algorithm solving the problem "is S partially confluent on the rational set R ?" for finite, basic, noetherian semi-Thue systems. The algorithm is obtained by a polynomial reduction of this problem to the equivalence-problem for deterministic 2-tape finite automata, which has been shown to be polynomially decidable in [Fri-Gre82].
Author supplied keywords
Cite
CITATION STYLE
Sénizergues, G. (1995). A polynomial algorithm testing partial confluence of basic semi-thue systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 914, pp. 194–209). Springer Verlag. https://doi.org/10.1007/3-540-59200-8_57
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
