A polynomial algorithm testing partial confluence of basic semi-Thue systems

Authors:
Géraud Sénizergues
Affiliations:
Univ. de Bordeaux I, Talence, France
Venue:
Theoretical Computer Science - Special issue: rewriting systems and applications
Year:
1998

Citing 0
Cited 3

Some Applications of the Decidability of DPDA's Equivalence

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
LARS: A learning algorithm for rewriting systems

Machine Learning
Rational subsets of partially reversible monoids

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract