On regular copying languages
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 devic...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Computer Science, Polish Academy of Sciences
2023-07-01
|
| Series: | Journal of Language Modelling |
| Subjects: | |
| Online Access: | https://jlm.ipipan.waw.pl/index.php/JLM/article/view/342 |