메뉴 건너뛰기




Volumn 1530 LNCS, Issue , 1998, Pages 319-331

On the confluence of trace rewriting systems

Author keywords

[No Author keywords available]

Indexed keywords

REWRITING SYSTEMS; TRACE MONOID;

EID: 84887036607     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49382-2_30     Document Type: Conference Paper
Times cited : (4)

References (10)
  • 2
    • 0005920350 scopus 로고
    • Recognizable subsets of some partially abelian monoids
    • 321
    • Robert Cori and Yves Métivier. Recognizable subsets of some partially abelian monoids. Theoretical Computer Science, 35:179-189, 1985. 321
    • (1985) Theoretical Computer Science , vol.35 , pp. 179-189
    • Cori, R.1    Métivier, Y.2
  • 5
    • 0023014931 scopus 로고
    • Mixed procuct and asynchronous automata
    • 329
    • Christine Duboc. Mixed procuct and asynchronous automata. Theoretical Computer Science, 48:183-199, 1986. 329
    • (1986) Theoretical Computer Science , vol.48 , pp. 183-199
    • Duboc, C.1
  • 8
    • 0024090701 scopus 로고
    • Preperfectness is undecidable for Thue systems containing only length-reducing rules and a single commutation rule
    • 319, 320, 322, 323
    • Paliath Narendran and Friedrich Otto. Preperfectness is undecidable for Thue systems containing only length-reducing rules and a single commutation rule. Information Processing Letters, 29:125-130, 1988. 319, 320, 322, 323
    • (1988) Information Processing Letters , vol.29 , pp. 125-130
    • Narendran, P.1    Otto, F.2
  • 9
    • 0013405734 scopus 로고
    • On confluence of one-rule trace-rewriting systems
    • 330
    • Celia Wrathall and Volker Diekert. On confluence of one-rule trace-rewriting systems. Mathematical Systems Theory, 28:341-361, 1995. 330
    • (1995) Mathematical Systems Theory , vol.28 , pp. 341-361
    • Wrathall, C.1    Diekert, V.2


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