Finite language forbidding-enforcing systems
The forbidding and enforcing paradigm was introduced by Ehrenfeucht and Rozenberg as a way to define families of languages based on two sets of boundary conditions. Later, a variant of this paradigm was considered where an fe-system defines a single language. We investigate this variant further by studying fe-systems in which both the forbidding and enforcing sets are finite and show that they define regular languages. We prove that the class of languages defined by finite fe-systems is strictly between the strictly locally testable languages and the class of locally testable languages.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Digital Object Identifier (DOI)
Genova, & Hoogeboom, H. J. (2017). Finite Language Forbidding-Enforcing Systems. In Unveiling Dynamics and Complexity (pp. 258–269). Springer International Publishing. https://doi.org/10.1007/978-3-319-58741-7_25