Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.635550
Title: Languages that require full scanning of words to determine membership
Author: Alwan, Suhear Saady
ISNI:       0000 0004 5357 1990
Awarding Body: University of Essex
Current Institution: University of Essex
Date of Award: 2014
Availability of Full Text:
Access through EThOS:
Abstract:
We introduce the Full Scan Condition on a language, which captures the idea that the membership question for a word w cannot be determined from a given prefix, suffix pair. We study the corresponding one-sided conditions, establish relationships between them, characterize these languages in the regular case through their minimal automata and syntactic monoids, and develop techniques for testing regularity of a language, Also, we investigate a topology on the free monoid that arises in the course of our research.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.635550  DOI: Not available
Share: