Share and Export
Share and Export
Power, James F. (2014) An early completion algorithm: Thue's 1914 paper on the transformation of symbol sequences. In: Language, Life, Limits : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings. Lecture Notes in Computer Science (8493). Springer International Publishing, pp. 343-346. ISBN 9783319080185
Preview
JP-Early-Completion.pdf
Download (185kB) | Preview
Abstract
References to Thue's 1914 paper on string transformation systems
are based mainly on a small section of that work defining Thue systems. A closer study of the remaining parts of that paper highlight a
number of important themes in the history of computing: the transition from algebra to formal language theory, the analysis of the "computational power" (in a pre-1936 sense) of rules, and the development
of algorithms to generate rule-sets.
| Item Type: | Book Section |
|---|---|
| Additional Information: | This is the preprint version of the published article, which is available at DOI: 10.1007/978-3-319-08019-2_35 |
| Keywords: | early completion algorithm; Thue systems; transformation of symbol sequences; string transformation systems; history of computing; |
| Academic Unit: | Faculty of Science and Engineering > Computer Science |
| Item ID: | 6372 |
| Identification Number: | 10.1007/978-3-319-08019-2_35 |
| Depositing User: | Dr. James Power |
| Date Deposited: | 22 Sep 2015 15:03 |
| Publisher: | Springer International Publishing |
| Refereed: | Yes |
| Related URLs: | |
| URI: | https://mural.maynoothuniversity.ie/id/eprint/6372 |
| Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only (login required)
- Item control page
Downloads
Downloads per month over past year
