Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems

Gheorghe Pǎun, Mario J. Pérez-Jiménez, Takashi Yokomori

    研究成果: Conference contribution

    1 引用 (Scopus)

    抄録

    Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability were obtained in this framework. In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of as small as possible complexity. For instance, each recursively enumerable language L can be represented in a way similar to the celebrated Chomsky-Scḧutzenberger representation of context-free languages, i.e., in the form L = h(L(γ) ∩D), where is an insertion system of weight (3, 0) (at most three symbols are inserted in a context of length zero), h is a projection, and D is a Dyck language. A similar representation can be obtained for regular languages, involving insertion systems of weight (2,0) and star languages, as well as for context-free languages - this time using insertion systems of weight (3, 0) and star languages.

    元の言語English
    ホスト出版物のタイトルDescriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007
    出版者Technical University of Kosice
    ページ129-140
    ページ数12
    ISBN(印刷物)9788070976883
    出版物ステータスPublished - 2007
    イベント9th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2007 - High Tatras
    継続期間: 2007 7 202007 7 22

    Other

    Other9th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2007
    High Tatras
    期間07/7/2007/7/22

    Fingerprint

    Context free languages
    Stars
    Formal languages
    Linguistics
    DNA

    ASJC Scopus subject areas

    • Software

    これを引用

    Pǎun, G., Pérez-Jiménez, M. J., & Yokomori, T. (2007). Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems. : Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007 (pp. 129-140). Technical University of Kosice.

    Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems. / Pǎun, Gheorghe; Pérez-Jiménez, Mario J.; Yokomori, Takashi.

    Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007. Technical University of Kosice, 2007. p. 129-140.

    研究成果: Conference contribution

    Pǎun, G, Pérez-Jiménez, MJ & Yokomori, T 2007, Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems. : Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007. Technical University of Kosice, pp. 129-140, 9th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2007, High Tatras, 07/7/20.
    Pǎun G, Pérez-Jiménez MJ, Yokomori T. Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems. : Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007. Technical University of Kosice. 2007. p. 129-140
    Pǎun, Gheorghe ; Pérez-Jiménez, Mario J. ; Yokomori, Takashi. / Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems. Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007. Technical University of Kosice, 2007. pp. 129-140
    @inproceedings{d16f150859044b8595a0e956d5c5cb43,
    title = "Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems",
    abstract = "Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability were obtained in this framework. In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of as small as possible complexity. For instance, each recursively enumerable language L can be represented in a way similar to the celebrated Chomsky-Scḧutzenberger representation of context-free languages, i.e., in the form L = h(L(γ) ∩D), where is an insertion system of weight (3, 0) (at most three symbols are inserted in a context of length zero), h is a projection, and D is a Dyck language. A similar representation can be obtained for regular languages, involving insertion systems of weight (2,0) and star languages, as well as for context-free languages - this time using insertion systems of weight (3, 0) and star languages.",
    keywords = "Context-free languages, Insertion-deletion systems, Recursively enumerable languages, Regular languages",
    author = "Gheorghe Pǎun and P{\'e}rez-Jim{\'e}nez, {Mario J.} and Takashi Yokomori",
    year = "2007",
    language = "English",
    isbn = "9788070976883",
    pages = "129--140",
    booktitle = "Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007",
    publisher = "Technical University of Kosice",

    }

    TY - GEN

    T1 - Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems

    AU - Pǎun, Gheorghe

    AU - Pérez-Jiménez, Mario J.

    AU - Yokomori, Takashi

    PY - 2007

    Y1 - 2007

    N2 - Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability were obtained in this framework. In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of as small as possible complexity. For instance, each recursively enumerable language L can be represented in a way similar to the celebrated Chomsky-Scḧutzenberger representation of context-free languages, i.e., in the form L = h(L(γ) ∩D), where is an insertion system of weight (3, 0) (at most three symbols are inserted in a context of length zero), h is a projection, and D is a Dyck language. A similar representation can be obtained for regular languages, involving insertion systems of weight (2,0) and star languages, as well as for context-free languages - this time using insertion systems of weight (3, 0) and star languages.

    AB - Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability were obtained in this framework. In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of as small as possible complexity. For instance, each recursively enumerable language L can be represented in a way similar to the celebrated Chomsky-Scḧutzenberger representation of context-free languages, i.e., in the form L = h(L(γ) ∩D), where is an insertion system of weight (3, 0) (at most three symbols are inserted in a context of length zero), h is a projection, and D is a Dyck language. A similar representation can be obtained for regular languages, involving insertion systems of weight (2,0) and star languages, as well as for context-free languages - this time using insertion systems of weight (3, 0) and star languages.

    KW - Context-free languages

    KW - Insertion-deletion systems

    KW - Recursively enumerable languages

    KW - Regular languages

    UR - http://www.scopus.com/inward/record.url?scp=84905842130&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84905842130&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:84905842130

    SN - 9788070976883

    SP - 129

    EP - 140

    BT - Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007

    PB - Technical University of Kosice

    ER -