Continuous languages
| dc.contributor.author | Ang, Thomas | |
| dc.contributor.author | Brzozowski, Janusz | |
| dc.date.accessioned | 2026-10-16T19:09:09Z | |
| dc.date.issued | 2008-03-12 | |
| dc.description.abstract | A language is prefix-continuous if it satisfies the condition that, if a word w and its prefix u are in the language, then so is every prefix of w that has u as a prefix. Prefix-continuous languages include prefix-closed languages at one end of the spectrum, which include prefix codes, at the other. In a similar way, we define suffix-, bifix-, factor-, and subword- continuous languages and their closed and free counterparts. We generalize these notions to arbitrary binary relations on the set of all words over a finite alphabet. This provides a common framework for diverse languages such as codes, factorial languages and ideals. We examine the relationships among these languages and their closure properties. | |
| dc.identifier.uri | https://hdl.handle.net/10012/24531 | |
| dc.language.iso | en | |
| dc.publisher | University of Waterloo | |
| dc.relation.ispartofseries | Computer Science Technical Reports; CS-2008-06 | |
| dc.title | Continuous languages | |
| dc.type | Technical Report | |
| uws.contributor.affiliation1 | Faculty of Mathematics | |
| uws.contributor.affiliation2 | David R. Cheriton School of Computer Science | |
| uws.peerReviewStatus | Unreviewed | |
| uws.scholarLevel | Faculty | |
| uws.typeOfResource | Text | en |