Author:
Gelle Kitti,Iván Szabolcs
Publisher
Springer International Publishing
Reference13 articles.
1. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata (Encyclopedia of Mathematics and Its Applications). Cambridge University Press, New York (2009).
https://dl.acm.org/citation.cfm?id=1708078
2. Brzozowski, J., Li, B.: Syntactic complexity of
$$R$$
- and
$$J$$
-trivial regular languages. Int. J. Found. Comput. Sci. 25(07), 807–821 (2014).
https://doi.org/10.1142/S0129054114400097
3. Brzozowski, J., Li, B., Liu, D.: Syntactic complexities of six classes of star-free languages. J. Autom. Lang. Comb. 17(2), 83–105 (2012)
4. Brzozowski, J.A., Li, B., Ye, Y.: Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. Theoret. Comput. Sci. 449, 37–53 (2012).
https://doi.org/10.1016/j.tcs.2012.04.011
. Preliminary version at DCFS 2011
5. Brzozowski, J.A., Szykuła, M., Ye, Y.: Syntactic complexity of regular ideals. Theory Comput. Syst. 62(5), 1175–1202 (2018).
https://doi.org/10.1007/s00224-017-9803-8