Abstract
Book and Otto (1993) solve a number of word problems for monadic string-rewriting systems using an elegant automata-based technique. In this note we observe that the technique is also very interesting from a pedagogical point of view, since it provides a uniform solution to several elementary problems on context-free languages.
Original language | English |
---|---|
Pages (from-to) | 221-227 |
Number of pages | 7 |
Journal | Information Processing Letters |
Volume | 74 |
Issue number | 5-6 |
DOIs | |
State | Published - 30 Jun 2000 |
Keywords
- Design of algorithms
- Formal languages