On the complexity of some extended word problems defined by cancellation rules

doi:10.1016/0020-0190(86)90087-6

Information Processing Letters

Volume 23, Issue 5, 24 November 1986, Pages 281-287

https://doi.org/10.1016/0020-0190(86)90087-6 Get rights and content

Abstract

We give an algorithm which computes the set of descendants of a regular set R, for Thue systems of certain type. The complexity of the algorithm is O(m³) where m is the number of states of an automaton recognising R. This allows to improve the known complexity bounds for some extended word problems defined by cancellation rules.

References (10)

R.V. Book et al.
Cancellation rules and extended word problems
Inform. Process. Lett.
(1985)
D. Dolev et al.
On the security of ping-pong protocols
Inform. and Control
(1982)
M. Fliess
Deux applications de la représentation matricielle d'une série rationnelle non commutative
J. Algebra
(1971)
M. Benois
Parties rationnelles du groupe libre
C.R. Acad. Sci. Paris Sér. A
(1969)
J. Berstel
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 Computation
Citation 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.
For the whole class of linear term rewriting systems, we define bottom-up rewriting which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting effectively inverse-preserves recognizability.
The Bottom-Up class ( $BU$ ) is, by definition, the set of linear systems for which every derivation can be replaced by a bottom-up derivation. Since membership to $BU$ turns out to be undecidable, we are led to define more restricted classes: the classes $SBU (k)$ , $k \in N$ , of Strongly Bottom-Up(k) systems for which we show that membership is decidable. We define the class of Strongly Bottom-Up systems by $SBU = ⋃_{k \in N} SBU (k)$ . We give a polynomial-time sufficient condition for a system to be in $SBU$ . The class $SBU$ contains (strictly) several classes of systems which were already known to inverse preserve recognizability: the inverse left-basic semi-Thue systems (viewed as unary term rewriting systems), the linear growing term rewriting systems, the inverse Linear-Finite-Path-Ordering systems.
The word problem for inverse monoids presented by one idempotent relator
1994, Theoretical Computer Science
We study inverse monoids presented by a finite set of generators and one relation e = 1, where e is a word representing an idempotent in the free inverse monoid, and 1 is the empty word. We show that (1) the word problem is solvable by a polynomial-time algorithm; (2) every congruence class (in the free monoid) with respect to such a presentation is a deterministic context-free language. Such congruence classes can be viewed as generalizations of parenthesis languages; and (3) the word problem is solvable by a linear-time algorithm in the more special case where e is a “positively labeled” idempotent.
On the security of p-party protocols
1988, Discrete Applied Mathematics
MEMBERSHIP PROBLEMS IN NILPOTENT GROUPS
2024, arXiv
Rational cross-sections, bounded generation and orders on groups
2022, arXiv
The rational subset membership problem for groups: A survey
2015, Groups St Andrews 2013

View all citing articles on Scopus

^☆: This work was partially supported by A.D.I. under Contract 83/695.

View full text

On the complexity of some extended word problems defined by cancellation rules☆

Abstract

Inform. Process. Lett.

Inform. and Control

J. Algebra

Parties rationnelles du groupe libre

C.R. Acad. Sci. Paris Sér. A

Transductions and Context-Free Languages