Interactive Editing Systems: Part I
ACM Computing Surveys (CSUR)
Syntax-directed editing of general data structures
Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
| Hi-index | 0.01 |
A universal editor problem has been formulated, based on a notion of editability specified by a class of formal text-manipulation models - T-spaces, for which editability is equivalent to computability.Unlike the superficially similar universal Turing machine problem, the universal editor problem and its complement are not r.e., so the ultimate universal editor is an unattainable goal.Thus the bad news is that we cannot manipulate all editable languages in all possible ways. Nevertheless, there are good news as well: we can still manipulate all r.e. languages in some ways.