Iterated Context-Independent Rewriting -- From Grammars to Transformations and Their Fixed Points. An Introduction.

P.R.J. Asveld

    Research output: Book/ReportReportOther research output

    Abstract

    In this introductory survey we show that context-free grammars and similar context-independent rewriting systems can be viewed as a mapping that transforms a finite number of finite languages into a countable language. These transformations also allow (a finite number of) languages from a family $K$ rather than finite languages. Many well-known closure properties can be characterized in terms of fixed points of such transformations. Finally, attention is focussed on (i) the set of all these fixed points, and (ii) partially ordered monoids generated by a finite number of such transformations.
    Original languageUndefined
    Place of PublicationEnschede
    PublisherUniversity of Twente, Department of Applied Mathematics
    Number of pages34
    Publication statusPublished - 1978

    Keywords

    • EWI-3718
    • HMI-SLT: Speech and Language Technology

    Cite this

    Asveld, P. R. J. (1978). Iterated Context-Independent Rewriting -- From Grammars to Transformations and Their Fixed Points. An Introduction. Enschede: University of Twente, Department of Applied Mathematics.
    Asveld, P.R.J. / Iterated Context-Independent Rewriting -- From Grammars to Transformations and Their Fixed Points. An Introduction. Enschede : University of Twente, Department of Applied Mathematics, 1978. 34 p.
    @book{dfc301c01ae44409a4d22d9bc1845294,
    title = "Iterated Context-Independent Rewriting -- From Grammars to Transformations and Their Fixed Points. An Introduction.",
    abstract = "In this introductory survey we show that context-free grammars and similar context-independent rewriting systems can be viewed as a mapping that transforms a finite number of finite languages into a countable language. These transformations also allow (a finite number of) languages from a family $K$ rather than finite languages. Many well-known closure properties can be characterized in terms of fixed points of such transformations. Finally, attention is focussed on (i) the set of all these fixed points, and (ii) partially ordered monoids generated by a finite number of such transformations.",
    keywords = "EWI-3718, HMI-SLT: Speech and Language Technology",
    author = "P.R.J. Asveld",
    year = "1978",
    language = "Undefined",
    publisher = "University of Twente, Department of Applied Mathematics",

    }

    Asveld, PRJ 1978, Iterated Context-Independent Rewriting -- From Grammars to Transformations and Their Fixed Points. An Introduction. University of Twente, Department of Applied Mathematics, Enschede.

    Iterated Context-Independent Rewriting -- From Grammars to Transformations and Their Fixed Points. An Introduction. / Asveld, P.R.J.

    Enschede : University of Twente, Department of Applied Mathematics, 1978. 34 p.

    Research output: Book/ReportReportOther research output

    TY - BOOK

    T1 - Iterated Context-Independent Rewriting -- From Grammars to Transformations and Their Fixed Points. An Introduction.

    AU - Asveld, P.R.J.

    PY - 1978

    Y1 - 1978

    N2 - In this introductory survey we show that context-free grammars and similar context-independent rewriting systems can be viewed as a mapping that transforms a finite number of finite languages into a countable language. These transformations also allow (a finite number of) languages from a family $K$ rather than finite languages. Many well-known closure properties can be characterized in terms of fixed points of such transformations. Finally, attention is focussed on (i) the set of all these fixed points, and (ii) partially ordered monoids generated by a finite number of such transformations.

    AB - In this introductory survey we show that context-free grammars and similar context-independent rewriting systems can be viewed as a mapping that transforms a finite number of finite languages into a countable language. These transformations also allow (a finite number of) languages from a family $K$ rather than finite languages. Many well-known closure properties can be characterized in terms of fixed points of such transformations. Finally, attention is focussed on (i) the set of all these fixed points, and (ii) partially ordered monoids generated by a finite number of such transformations.

    KW - EWI-3718

    KW - HMI-SLT: Speech and Language Technology

    M3 - Report

    BT - Iterated Context-Independent Rewriting -- From Grammars to Transformations and Their Fixed Points. An Introduction.

    PB - University of Twente, Department of Applied Mathematics

    CY - Enschede

    ER -

    Asveld PRJ. Iterated Context-Independent Rewriting -- From Grammars to Transformations and Their Fixed Points. An Introduction. Enschede: University of Twente, Department of Applied Mathematics, 1978. 34 p.