- Tytuł:
- On regular copying languages
- Autorzy:
-
Wang, Yang
Hunter, Tim - Powiązania:
- https://bibliotekanauki.pl/articles/24201233.pdf
- Data publikacji:
- 2023
- Wydawca:
- Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
- Tematy:
-
reduplication
copying
finite-state machinery
queue automata - Opis:
- This paper proposes a formal model of regular languages enriched with unbounded copying. We augment finite-state machinery with the ability to recognize copied strings by adding an unbounded memory buffer with a restricted form of first-in-first-out storage. The newly introduced computational device, finite-state buffered machines (FS-BMs), characterizes the class of regular languages and languages de-rived from them through a primitive copying operation. We name this language class regular copying languages (RCLs). We prove a pumping lemma and examine the closure properties of this language class. As suggested by previous literature (Gazdar and Pullum 1985, p.278), regular copying languages should approach the correct characteriza-tion of natural language word sets.
- Źródło:
-
Journal of Language Modelling; 2023, 11, 1; 1--66
2299-856X
2299-8470 - Pojawia się w:
- Journal of Language Modelling
- Dostawca treści:
- Biblioteka Nauki
Artykuł