메뉴 건너뛰기




Volumn 3317, Issue , 2005, Pages 134-145

Finding finite automata that certify termination of string rewriting

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER PROGRAMMING; METADATA; SOFTWARE ENGINEERING;

EID: 23944476575     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30500-2_13     Document Type: Conference Paper
Times cited : (2)

References (16)
  • 2
    • 0022417331 scopus 로고
    • 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 scopus 로고
    • 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
  • 6
    • 35048879383 scopus 로고    scopus 로고
    • 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
  • 8
    • 0016080041 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.