In theoretical computer science and mathematical logic a string rewriting system (SRS), historically called a semi-Thue system, is a rewriting systemâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Michel Latteux, Yves Roos
- Fundam. Inform.
- 2012

The family of one-rule grid semi-Thue systems, introduced by Alfons Geser, is the family of one-rule semi-Thue systems such thatâ€¦Â (More)

Is this relevant?

2008

2008

- FranÃ§ois Nicolas
- ArXiv
- 2008

Let PCP(k) denote the following restriction of the well-known Post Correspondence Problem [9]: given alphabet Î£ of cardinality kâ€¦Â (More)

Is this relevant?

2006

2006

- Peter Ackermann, Martin Kreuzer
- Applicable Algebra in Engineering, Communicationâ€¦
- 2006

In the first sections we extend and generalize GrÃ¶bner basis theory to submodules of free right modules over monoid rings. Overâ€¦Â (More)

Is this relevant?

2005

2005

- Detlef Plump
- Processes, Terms and Cycles
- 2005

It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or notâ€”in contrast to theâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Ninghui Li, John C. Mitchell
- International Journal of Information Security
- 2003

SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-orderâ€¦Â (More)

Is this relevant?

2001

2001

- Robert McNaughton
- Journal of Automated Reasoning
- 2001

A semi-Thue system with an inhibitor is one having a special symbol, called an inhibitor, that appears on the right side of everyâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Detlef Plump
- Fundam. Inform.
- 1998

It is shown that it is undecidable in general whether a graph rewriting system (in the \double pushout approach") is terminatingâ€¦Â (More)

Is this relevant?

1990

1990

- Clemens Lautemann
- Acta Informatica
- 1990

Although in many ways, hyperedge replacement graph grammars (HRGs) are, among all graph generating mechanisms, what context-freeâ€¦Â (More)

Is this relevant?

1986

1986

- Friedrich Otto
- Theor. Comput. Sci.
- 1986

A semi-Thue system S (Thue system T) is self-embedding if there exist words x, y and z such that xz ~ e and y ~*xyz(y*-,*xyzâ€¦Â (More)

Is this relevant?

1985

1985

- Deepak Kapur, Paliath Narendran
- Theor. Comput. Sci.
- 1985

We present a single-axiom Thue system with a decidable word problem for which there does not exist any finite equivalentâ€¦Â (More)

Is this relevant?