Journal ArticleDOI
On the complexity of some extended word problems defined by cancellation rules
M Benois,Jacques Sakarovitch +1 more
Reads0
Chats0
TLDR
An algorithm which computes the set of descendants of a regular set R, for Thue systems of certain type is given, which allows to improve the known complexity bounds for some extended word problems defined by cancellation rules.About:
This article is published in Information Processing Letters.The article was published on 1986-12-03. It has received 23 citations till now. The article focuses on the topics: Formal language & Computational complexity theory.read more
Citations
More filters
Book ChapterDOI
Decidability of Reachability Problems for Classes of Two Counters Automata
Alain Finkel,Grégoire Sutre +1 more
TL;DR: A global and comprehensive view of the properties of subclasses of two counters automata for which counters are only accessed through the following operations: increment (+1), decrement (-1), reset (c := 0), transfer (the whole content of counter c is transfered into counter c′), and testing for zero is presented.
The Rational Subset Membership Problem for Groups: A Survey
TL;DR: A survey of decidability and undecidability results for rational subset membership problems for groups is given in this article, where rational subsets of a group G are defined as the smallest class of subsets that contain all finite subsets and are closed with respect to union, product and taking the monoid generated by a set.
Journal ArticleDOI
The word problem for inverse monoids presented by one idempotent relator
TL;DR: Every congruence class in the free monoid with respect to such a presentation is a deterministic context-free language, and the word problem is solvable by a polynomial-time algorithm.
Journal ArticleDOI
Some decision problems about controlled rewriting systems
TL;DR: This paper deduces a characterisation of dcfls by means of finitely generated congruences, and studies three decision problems on finite semi-Thue systems, namely the class equivalence problem, the word problem for the syntactic congruence of one class and the partial confluence problem.
Book ChapterDOI
Bottom-up rewriting is inverse recognizability preserving
Irène Durand,Géraud Sénizergues +1 more
TL;DR: It is shown that bottom-up rewriting effectively inverse-preserves recognizability and the complexity of the underlying construction is analyzed.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
On the security of public key protocols
Danny Dolev,Andrew Chi-Chih Yao +1 more
TL;DR: Several models are formulated in which the security of protocols can be discussed precisely, and algorithms and characterizations that can be used to determine protocol security in these models are given.
Journal ArticleDOI
A Theorem on Boolean Matrices
TL;DR: It is proved the validity of an algorithm whose running time goes up slightly faster than the square of d, the running times of which increase-other things being equal-as the cube of d.
Proceedings ArticleDOI
On the security of multi-party ping-pong protocols
Shimon Even,Oded Goldreich +1 more
TL;DR: It is shown that if p, the number of participants in the protocol, is part of the input then the security problem becomes NP-Hard and Relaxing the definition of a ping-pong protocol so that operators can operate on half words causes theSecurity problem to become undecidable.