Abstract
Given a partiallyordered finite alphabet Sigma and a language L subseteq Sigma^*, how large can an antichain in L be (where L is given the lexicographic ordering)? More precisely, since L will in general be infinite, we should ask about the rate of growth of maximum antichains consisting of words of length n. This fundamental property of partial orders is known as the width, and in a companion work [Mestel, 2019] we show that the problem of computing the information leakage permitted by a deterministic interactive system modeled as a finitestate transducer can be reduced to the problem of computing the width of a certain regular language. In this paper, we show that if L is regular then there is a dichotomy between polynomial and exponential antichain growth. We give a polynomialtime algorithm to distinguish the two cases, and to compute the order of polynomial growth, with the language specified as an NFA. For contextfree languages we show that there is a similar dichotomy, but now the problem of distinguishing the two cases is undecidable. Finally, we generalise the lexicographic order to tree languages, and show that for regular tree languages there is a trichotomy between polynomial, exponential and doubly exponential antichain growth.
BibTeX  Entry
@InProceedings{mestel:LIPIcs:2019:11611,
author = {David Mestel},
title = {{Widths of Regular and ContextFree Languages}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {49:149:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959771313},
ISSN = {18688969},
year = {2019},
volume = {150},
editor = {Arkadev Chattopadhyay and Paul Gastin},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11611},
URN = {urn:nbn:de:0030drops116111},
doi = {10.4230/LIPIcs.FSTTCS.2019.49},
annote = {Keywords: Formal languages, combinatorics on words, information flow}
}
Keywords: 

Formal languages, combinatorics on words, information flow 
Collection: 

39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019) 
Issue Date: 

2019 
Date of publication: 

04.12.2019 