Complexity of bifix-free regular languages
Tài liệu tham khảo
Berstel, 2009
Jürgensen, 1997, Codes, 511
Brzozowski, 2011, Decision problems for convex languages, Inform. and Comput., 209, 353, 10.1016/j.ic.2010.11.009
Pin, 1997, Syntactic semigroups, 679
McNaughton, 1971, Counter-Free Automata, vol. 65
Brzozowski, 2014, Theory of átomata, Theoret. Comput. Sci., 539, 13, 10.1016/j.tcs.2014.04.016
Brzozowski, 2013, In search of the most complex regular languages, Internat. J. Found. Comput. Sci., 24, 691, 10.1142/S0129054113400133
J.A. Brzozowski, S. Davies, B.Y.V. Liu, Most complex regular ideals, Discrete Math. Theoret. Comput. Sci. 18 (3).
Brzozowski, 2017, Complexity of prefix-convex regular languages, vol. 10329, 52
Brzozowski, 2015, Complexity of suffix-free regular languages, vol. 9210, 146
Sinnamon, 2018, Complexity of proper suffix-convex regular languages, 324
Brzozowski, 2014, Quotient complexity of bifix-, factor-, and subword-free regular languages, Acta Cybernet., 21, 507, 10.14232/actacyb.21.4.2014.1
Brzozowski, 2012, Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages, Theoret. Comput. Sci., 449, 37, 10.1016/j.tcs.2012.04.011
Szykuła, 2017, Syntactic complexity of bifix-free languages, vol. 10329, 76
Brzozowski, 2010, Quotient complexity of regular languages, J. Autom. Lang. Comb., 15, 71
Iván, 2016, Complexity of atoms, combinatorially, Inform. Process. Lett., 116, 356, 10.1016/j.ipl.2016.01.003
Cmorik, 2012, Basic operations on binary suffix-free languages, 94
Eom, 2016, State complexity of basic operations on non-returning regular languages, Fund. Inform., 144, 161
Jirásková, 2014, Kleene closure on regular and prefix-free languages, 226
Jirásková, 2008, On the state complexity of complements, stars, and reversals of regular languages, 431
Šebej, 2013, Reversal on regular languages and descriptional complexity, 265
Piccard, 1938, Sur les bases du group symétrique et du groupe alternant, Comment. Math. Helv., 11, 1, 10.1007/BF01199686
Brzozowski, 2017, Most complex non-returning regular languages, vol. 10316, 89