Publication at Faculty of Mathematics and Physics |
2018
Abstract
We present a transformation from several types of monotone deterministic two-way restarting list automata (RLAs) that do not have any type of correctness preserving property into several types of monotone deterministic RLAs that satisfy the complete strong correctness preserving property. These types of automata provide new characterizations for the class LRR of left-to-right regular languages, which are suitable for the (lexical) disambiguation of the syntactic analysis of individual LRR-languages and for the localization of syntactical errors.