Distinguishability Operations and Closures

• Type: Article in International Scientific Journal
• Date: 2016

Authors

Campeanu, C (Author) Other; Nelma Moreira (Author) FCUP; Rogério Reis (Author) FCUP

Journal

Title: Fundamenta Informaticae

Vol. 148

Pages: 243-266

ISSN: 0169-2968

Publisher: IOS PRESS

Indexing

ISI Web of Knowledge - 5 Citations

Scopus - 6 Citations

Other information

Authenticus ID: P-00M-AMF

DOI: 10.3233/fi-2016-1434

Abstract (EN): Given a language L, we study the language of words D (L), that distinguish between pairs of different left quotients of L. We characterize this distinguishability operation, show that its iteration has always a fixed point, and we generalize this result to operations derived from closure operators and Boolean operators. For the case of regular languages, we give an upper bound for the state complexity of the distinguishability operation, and prove its tightness. We show that the set of minimal words that can be used to distinguish between different left quotients of a regular language L has at most n - 1 elements, where n is the state complexity of L, and we also study the properties of its iteration. We generalize the results for the languages of words that distinguish between pairs of different right quotients and two-sided quotients of a language L.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 24