| |
Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Grammars And Other Rewriting Systems (F.4.2) > Thue Systems (F.4.2...)
|
|
 |
|
|
| |
|
|
| |
1-6 of 6
Reviews about "Thue Systems (F.4.2...)":
|
Date Reviewed |
| |
Solving discriminant form equations via unit equations
Smart N. Journal of Symbolic Computation 21(3): 367-374, 1996. Type: Article
For general number fields, the only known method for solving discriminant and index form equations of Thue and Mahler type is Györy’s. This method is generally considered too time-consuming to be of any practical ben...
|
Aug 1 1997 |
| |
Some undecidable termination problems for semi-Thue systems
Sénizergues G. Theoretical Computer Science 142(2): 257-276, 1995. Type: Article
The termination problem for semi-Thue systems is the problem of deciding, for a given semi-Thue system S and a word w, whether every derivation modulo S starting on w
|
Apr 1 1996 |
| |
A new lower bound construction for commutative Thue systems with applications
Yap C. Journal of Symbolic Computation 12(1): 1-27, 1991. Type: Article
Mayr and Meyer showed in 1982 that the uniform word problem for commutative Thue systems is complete for exponential space. In this proof, a commutative Thue system is constructed that counts to 2 2 n
|
Oct 1 1992 |
| |
Non-repetitive words relative to a rewriting system
Carpi A., de Luca A. Theoretical Computer Science 72(1): 39-53, 1990. Type: Article
Words here are arbitrary sequences of letters from a fixed alphabet. Since there are just NK K-letter words on an N-letter alphabet, it is easy to see that long enough words must have repetitive s...
|
May 1 1991 |
| |
Thue systems as rewriting systems
Book R. (ed) Journal of Symbolic Computation 3(1-2): 39-68, 1987. Type: Article
Rewriting systems facilitate the study of equational theories, especially in situations where general-purpose techniques prove to be unsuccessful. A rewriting system is a set of equations (ri = si), ...
|
Dec 1 1988 |
| |
Deciding algebraic properties of monoids presented by finite Church-Rosser Thue systems
Otto F. Rewriting techniques and applications (, Dijon, France, 1061985. Type: Proceedings
If &Sgr; is an alphabet, a Thue system T over &Sgr; is a set of pairs of &Sgr;-words. It defines a congruence on the monoid &Sgr;* of &Sgr;-w...
|
Mar 1 1987 |
| |
|
|
| |
|
|
