@inproceedings{wang-2021-recognizing,
    title = "Recognizing Reduplicated Forms: Finite-State Buffered Machines",
    author = "Wang, Yang",
    editor = "Nicolai, Garrett  and
      Gorman, Kyle  and
      Cotterell, Ryan",
    booktitle = "Proceedings of the 18th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology",
    month = aug,
    year = "2021",
    address = "Online",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/fix-sig-urls/2021.sigmorphon-1.20/",
    doi = "10.18653/v1/2021.sigmorphon-1.20",
    pages = "177--187",
    abstract = "Total reduplication is common in natural language phonology and morphology. However, formally as copying on reduplicants of unbounded size, unrestricted total reduplication requires computational power beyond context-free, while other phonological and morphological patterns are regular, or even sub-regular. Thus, existing language classes characterizing reduplicated strings inevitably include typologically unattested context-free patterns, such as reversals. This paper extends regular languages to incorporate reduplication by introducing a new computational device: finite state buffered machine (FSBMs). We give its mathematical definitions and discuss some closure properties of the corresponding set of languages. As a result, the class of regular languages and languages derived from them through a copying mechanism is characterized. Suggested by previous literature, this class of languages should approach the characterization of natural language word sets."
}