P. Berman, A. Bhattacharyya, E. Grigorescu, S. Raskhodnikova, D. P. Woodruff et al., Steiner transitive-closure spanners of low-dimensional posets, Combinatorica, pp.1-24, 2014.

N. Blum, More on the power of chain rules in context-free grammars, Special Issue Ninth International Colloquium on Automata, Languages and Programming (ICALP) Aarhus, pp.287-295, 1982.
DOI : 10.1016/0304-3975(82)90122-0

J. Hromkovic, S. Seibert, and T. Wilke, Translating regular expressions into small epsilon-free nondeterministic finite automata, Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS '97, pp.55-66, 1997.

D. S. Johnson, Approximation algorithms for combinatorial problems, Proceedings of the fifth annual ACM symposium on Theory of computing , STOC '73, pp.38-49, 1973.
DOI : 10.1145/800125.804034

S. Jukna, Boolean Function Complexity -Advances and Frontiers, volume 27 of Algorithms and combinatorics, 2012.

S. Jukna, Computational Complexity of Graphs, Advances in Network Complexity, pp.99-153, 2013.
DOI : 10.1002/9783527670468.ch05

J. Kollár, L. Rónyai, and T. Szabó, Norm-graphs and bipartite tur???n numbers, Combinatorica, vol.17, issue.3, pp.399-406, 1996.
DOI : 10.1007/BF01261323

L. Lovász, A kombinatorika minimax tételeir? ol, Matematikai Lapok, vol.26, pp.209-264, 1975.

L. Lovász, On the ratio of optimal integral and fractional covers, Discrete Mathematics, vol.13, issue.4, pp.383-390, 1975.
DOI : 10.1016/0012-365X(75)90058-8

O. B. Lupanov, On rectifier and switching-and-rectifier schemes, Dokl. Akad. Nauk SSSR, vol.111, pp.1171-1174, 1956.

K. Mehlhorn, Some remarks on Boolean sums, Mathematical Foundations of Computer Science Lecture Notes in Computer Science, vol.74, pp.375-380, 1979.
DOI : 10.1007/3-540-09526-8_36

URL : http://hdl.handle.net/11858/00-001M-0000-0014-AF87-1

R. Albert, M. J. Meyer, and . Fischer, Economy of description by automata, grammars, and formal systems, SWAT (FOCS), pp.188-191, 1971.

E. I. Nechiporuk, On a Boolean matrix, Systems Theory Res, vol.21, pp.236-239, 1971.

N. Pippenger and L. G. Valiant, Shifting Graphs and Their Applications, Journal of the ACM, vol.23, issue.3, pp.423-432, 1976.
DOI : 10.1145/321958.321962

G. Schnitger, Regular Expressions and NFAs Without ??-Transitions, 23th Symposium on Theoretical Aspects of Computer Science (STACS 2006), pp.432-443, 2006.
DOI : 10.1007/11672142_35

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.8301

S. Stein, Two combinatorial covering theorems, Journal of Combinatorial Theory, Series A, vol.16, issue.3, pp.391-397, 1974.
DOI : 10.1016/0097-3165(74)90062-4

URL : http://doi.org/10.1016/0097-3165(74)90062-4

I. Wegener, A new lower bound on the monotone network complexity of Boolean sums, Acta Informatica, vol.13, issue.2, pp.109-114, 1980.
DOI : 10.1007/BF00263988

I. Wegener, The Complexity of Boolean Functions, 1987.

P. David, D. B. Williamson, and . Shmoys, The Design of Approximation Algorithms, 2011.