-
2
-
-
0022417331
-
Cancellation rules and extended word problems
-
R. V. Book and F. Otto. Cancellation rules and extended word problems. Inform. Process. Lett., 20:5-11, 1985.
-
(1985)
Inform. Process. Lett.
, vol.20
, pp. 5-11
-
-
Book, R.V.1
Otto, F.2
-
3
-
-
0003736084
-
-
Texts and Monographs in Computer Science. Springer-Verlag, New York
-
R. V. Book and F. Otto. String-Rewriting Systems. Texts and Monographs in Computer Science. Springer-Verlag, New York, 1993.
-
(1993)
String-Rewriting Systems
-
-
Book, R.V.1
Otto, F.2
-
4
-
-
85034639398
-
Termination of linear rewriting systems
-
S. Even and O. Kariv (Eds.). Springer-Verlag
-
N. Dershowitz. Termination of linear rewriting systems. In S. Even and O. Kariv (Eds.), Proc. 8th Int. Coll. on Automata, Languages and Programming ICALP-81, Lecture Notes in Comput. Sci. Vol. 115, pp. 448-458. Springer-Verlag, 1981.
-
(1981)
Proc. 8th Int. Coll. on Automata, Languages and Programming ICALP-81, Lecture Notes in Comput. Sci.
, vol.115
, pp. 448-458
-
-
Dershowitz, N.1
-
5
-
-
35248874351
-
Match-bounded string rewriting systems
-
B. Rovan and P. Vojtas (Eds.). Springer-Verlag
-
A. Geser, D. Hofbauer and J. Waldmann. Match-bounded string rewriting systems. In B. Rovan and P. Vojtas (Eds.), Proc. 28th Int. Symp. Mathematical Foundations of Computer Science MFCS-03, Lecture Notes in Comput. Sci. Vol. 2747, pp. 449-459. Springer-Verlag, 2003.
-
(2003)
Proc. 28th Int. Symp. Mathematical Foundations of Computer Science MFCS-03, Lecture Notes in Comput. Sci.
, vol.2747
, pp. 449-459
-
-
Geser, A.1
Hofbauer, D.2
Waldmann, J.3
-
6
-
-
35048879383
-
Match-bounded string rewriting systems
-
NIA Report 2003-09, National Institute of Aerospace, Hampton, VA, USA. Accepted for
-
A. Geser, D. Hofbauer and J. Waldmann. Match-bounded string rewriting systems. NIA Report 2003-09, National Institute of Aerospace, Hampton, VA, USA. Available at http://research.nianet.org/~geser/papers/nia-matchbounded.html. Accepted for Appl. Algebra Engrg. Comm. Comput.
-
Appl. Algebra Engrg. Comm. Comput.
-
-
Geser, A.1
Hofbauer, D.2
Waldmann, J.3
-
7
-
-
35048887144
-
Automated termination proofs with AProVE
-
V. van Oostrom (Ed.), Springer. Tool and description
-
J. Giesl, R. Thiemann, P. Schneider-Kamp and S. Falke. Automated termination proofs with AProVE. In V. van Oostrom (Ed.), Proc. 15th Int. Conf. Rewriting Techniques and Applications RTA-04, Lecture Notes in Comp. Sci., Springer, 2004. Tool and description available at http://www-12.informatik.rwth- aachen.de/AProVE/.
-
(2004)
Proc. 15th Int. Conf. Rewriting Techniques and Applications RTA-04, Lecture Notes in Comp. Sci.
-
-
Giesl, J.1
Thiemann, R.2
Schneider-Kamp, P.3
Falke, S.4
-
8
-
-
0016080041
-
Context-limited grammars
-
T. N. Hibbard. Context-limited grammars. J. ACM, 21(3):446-453, 1974.
-
(1974)
J. ACM
, vol.21
, Issue.3
, pp. 446-453
-
-
Hibbard, T.N.1
-
10
-
-
84958060253
-
Peg-solitaire, string rewriting systems and finite automata
-
H.-W. Leong, H. Imai, and S. Jain (Eds.). Springer-Verlag
-
B. Ravikumar. Peg-solitaire, string rewriting systems and finite automata. In H.-W. Leong, H. Imai, and S. Jain (Eds.), Proc. 8th Int. Symp. Algorithms and Computation ISAAC-97, Lecture Notes in Comput. Sci. Vol. 1350, pp. 233-242. Springer-Verlag, 1997.
-
(1997)
Proc. 8th Int. Symp. Algorithms and Computation ISAAC-97, Lecture Notes in Comput. Sci.
, vol.1350
, pp. 233-242
-
-
Ravikumar, B.1
-
14
-
-
18944374600
-
Termination
-
Cambridge University Press
-
H. Zantema. Termination. In Term Rewriting Systems, by Terese, pages 181-259. Cambridge University Press, 2003.
-
(2003)
Term Rewriting Systems, by Terese
, pp. 181-259
-
-
Zantema, H.1
-
16
-
-
33645405719
-
Termination of string rewriting proved automatically
-
Accepted for
-
H. Zantema. Termination of string rewriting proved automatically. Accepted for J. Automat. Reason., 2004.
-
(2004)
J. Automat. Reason.
-
-
Zantema, H.1
|