Codes modulo finite monadic string-rewriting systems

Friedrich Otto; Paliath Narendran

doi:10.1016/0304-3975(94)90284-4

Codes modulo finite monadic string-rewriting systems

Friedrich Otto
, Paliath Narendran

Computer Science

University at Albany

Fachbereich Elektrotechnik/Informatik

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

A set C⊆Σ^* is called a code modulo a string-rewriting system T if, for all v₁,v₂,...v_k, w₁,w₂,...,w_mε{lunate}C,v₁v₂...v_k↔^* _T w₁w₂...w_m implies that it is decidable whether a regular set is a code modulo T, when T is a finite string-rewriting system that is monadic and confluent, or that is special and λ-confluent.

Original language	English
Pages (from-to)	175-188
Number of pages	14
Journal	Theoretical Computer Science
Volume	134
Issue number	1
DOIs	https://doi.org/10.1016/0304-3975(94)90284-4
State	Published - Nov 7 1994

Access to Document

10.1016/0304-3975(94)90284-4

Cite this

@article{9599e7f97728429b9c9dede1ac006a67,

title = "Codes modulo finite monadic string-rewriting systems",

abstract = "A set C⊆Σ* is called a code modulo a string-rewriting system T if, for all v1,v2,...vk, w1,w2,...,wmε\{lunate\}C,v1 v2...vk↔* T w1w2...wm implies that it is decidable whether a regular set is a code modulo T, when T is a finite string-rewriting system that is monadic and confluent, or that is special and λ-confluent.",

author = "Friedrich Otto and Paliath Narendran",

year = "1994",

month = nov,

day = "7",

doi = "10.1016/0304-3975(94)90284-4",

language = "English",

volume = "134",

pages = "175--188",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Codes modulo finite monadic string-rewriting systems

AU - Otto, Friedrich

AU - Narendran, Paliath

PY - 1994/11/7

Y1 - 1994/11/7

N2 - A set C⊆Σ* is called a code modulo a string-rewriting system T if, for all v1,v2,...vk, w1,w2,...,wmε{lunate}C,v1 v2...vk↔* T w1w2...wm implies that it is decidable whether a regular set is a code modulo T, when T is a finite string-rewriting system that is monadic and confluent, or that is special and λ-confluent.

AB - A set C⊆Σ* is called a code modulo a string-rewriting system T if, for all v1,v2,...vk, w1,w2,...,wmε{lunate}C,v1 v2...vk↔* T w1w2...wm implies that it is decidable whether a regular set is a code modulo T, when T is a finite string-rewriting system that is monadic and confluent, or that is special and λ-confluent.

UR - https://www.scopus.com/pages/publications/0028767774

U2 - 10.1016/0304-3975(94)90284-4

DO - 10.1016/0304-3975(94)90284-4

M3 - Article

SN - 0304-3975

VL - 134

SP - 175

EP - 188

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

ER -

Codes modulo finite monadic string-rewriting systems

Abstract

Access to Document

Other files and links

Fingerprint

Cite this