On the complexity of some extended word problems defined by cancellation rules☆
References (10)
- et al.
Cancellation rules and extended word problems
Inform. Process. Lett.
(1985) - et al.
On the security of ping-pong protocols
Inform. and Control
(1982) Deux applications de la représentation matricielle d'une série rationnelle non commutative
J. Algebra
(1971)Parties rationnelles du groupe libre
C.R. Acad. Sci. Paris Sér. A
(1969)Transductions and Context-Free Languages
(1979)
There are more references available in the full text version of this article.
Cited by (12)
Bottom-up rewriting for words and terms
2015, Journal of Symbolic ComputationCitation Excerpt :The class of Finite-path Overlapping systems contains the class of growing systems (Nagaya and Toyama, 2002). Previous works on semi-Thue systems also prove recognizability preservation, under syntactic restrictions: cancellation systems (Benois and Sakarovitch, 1986), monadic systems (Book et al., 1982), basic systems (Benois, 1987), and left-basic systems (Sakarovitch, 1979) (see Sénizergues, 1995 for a survey). Other works establish that some strategies i.e. restrictions on the derivations rather than on the rules, ensure preservation of recognizability.
The word problem for inverse monoids presented by one idempotent relator
1994, Theoretical Computer ScienceOn the security of p-party protocols
1988, Discrete Applied MathematicsMEMBERSHIP PROBLEMS IN NILPOTENT GROUPS
2024, arXivThe rational subset membership problem for groups: A survey
2015, Groups St Andrews 2013
- ☆
This work was partially supported by A.D.I. under Contract 83/695.
Copyright © 1986 Published by Elsevier B.V.