Finitely generated sofic systems
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Handbook of formal languages, vol. 1
Theory of Codes
Representation of a class of nondeterministic semiautomata by canonical words
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Factorial languages of low combinatorial complexity
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Decision problems for convex languages
Information and Computation
Quotient complexity of ideal languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Quotient complexity of closed languages
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Complexity in convex languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Quotient complexity of ideal languages
Theoretical Computer Science
Quotient Complexity of Closed Languages
Theory of Computing Systems
| Hi-index | 0.00 |
A language is prefix-convex 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-convex languages include prefix-closed languages at one end of the spectrum, and prefix-free languages, which include prefix codes, at the other. In a similar way, we define suffix-, bifix-, factor-, and subword-convex languages and their closed and free counterparts. This provides a common framework for diverse languages such as codes, factorial languages and ideals. We examine the relationships among these languages. We generalize these notions to arbitrary binary relations on the set of all words over a given alphabet, and study the closure properties of such languages.