Peg-solitaire, string rewriting systems and finite automata-Reference-Cited by-同舟云学术

Peg-solitaire, string rewriting systems and finite automata

Published:1997 Issue: Volume: Page:233-242
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Ravikvmar B.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63890-3_26

Reference13 articles.

1. D. Avis and A. Deza 1996. Solitaire Cones, Technical Report, School of Computer Science, McGill University.

2. E. Berlekamp, J. Conway and R. Guy 1982. Winning Ways for Your Mathematical Plays: Vol. 1 Academic Press.

3. J. D. Beasley 1985. Ins and Outs of Peg Solitaire, Oxford University Press, Recreations in Mathematics Series.

4. R. Book and F. Otto 1993. String Rewriting Systems Springer-Verlag Graduate Texts in Computer Science.

5. R. Downey and M. Fellows, 1992. Fixed-parameter Intractability. Proceedings of 7th Annual Conf. on Structure in Complexity Theory, IEEE Computer Society Press, Los Alamitos, CA, 1992.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS;International Journal of Foundations of Computer Science;2005-06

2. Finding Finite Automata That Certify Termination of String Rewriting;Implementation and Application of Automata;2005

3. Match-Bounded String Rewriting Systems;Applicable Algebra in Engineering, Communication and Computing;2004-10-14

4. Periodicity in one-dimensional peg duotaire;Theoretical Computer Science;2004-02

5. Matchbox: A Tool for Match-Bounded String Rewriting;Rewriting Techniques and Applications;2004