On Formal Descriptions of Code Properties
Stavros Konstantinidis · 2010
•To be compatible with and (when possible) moregeneral than other existing methodologies.•To be able to decide efficiently, given the descrip-tion of a code property Pand a regular languageL, whether L satisfies P.•To be able to decide (efficiently?), given the de-scription of a code property Pand a regular lan-guage L, whether L is maximal with the prop-erty P.•To be able to build a LAnguage SERver that al-lows a user to enter descriptions of code propertiesandproduce answers toquestions aboutlanguageswith the desired code properties.Theorem 3 Let n ≥2. The class of n-independenceproperties is uncountable. In fact, already the class of n-independence properties whose elements are prefix codesis uncountable.As any set of descriptions is countable, we cannot de-fine/describe formally all possible independence prop-erties.6