Title

Finite language forbidding-enforcing systems

Document Type

Conference Proceeding

Publication Date

1-1-2017

Subject Area

ARRAY(0x5575b09fe620)

Abstract

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.

Publication Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volume

10307 LNCS

First Page

258

Last Page

269

Digital Object Identifier (DOI)

10.1007/978-3-319-58741-7_25

ISSN

03029743

E-ISSN

16113349

ISBN

9783319587400

Share

COinS