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.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:635550 |
| Date | January 2014 |
| Creators | Alwan, Suhear Saady |
| Publisher | University of Essex |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
Page generated in 0.0027 seconds