Caron, Pascal; Luque, Jean-Gabriel; Patrou, Bruno Operational state complexity revisited: the contribution of monsters and modifiers. (English) Zbl 07729454 Bordihn, Henning (ed.) et al., Descriptional complexity of formal systems. 25th IFIP WG 1.02 international conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13918, 1-20 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Caron} et al., Lect. Notes Comput. Sci. 13918, 1--20 (2023; Zbl 07729454) Full Text: DOI
Caron, Pascal; Hamel-de le Court, Edwin; Luque, Jean-Gabriel Combination of roots and Boolean operations: an application to state complexity. (English) Zbl 07629152 Inf. Comput. 289, Part A, Article ID 104961, 18 p. (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Caron} et al., Inf. Comput. 289, Part A, Article ID 104961, 18 p. (2022; Zbl 07629152) Full Text: DOI
Gruber, Hermann; Holzer, Markus; Kutrib, Martin Descriptional complexity of regular languages. (English) Zbl 1510.68036 Pin, Jean-Éric (ed.), Handbook of automata theory. Volume I. Theoretical foundations. Berlin: European Mathematical Society (EMS). 411-457 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{H. Gruber} et al., in: Handbook of automata theory. Volume I. Theoretical foundations. Berlin: European Mathematical Society (EMS). 411--457 (2021; Zbl 1510.68036) Full Text: DOI
Brzozowski, Janusz A.; Kari, Lila; Li, Bai; Szykuła, Marek State complexity of overlap assembly. (English) Zbl 1458.68091 Int. J. Found. Comput. Sci. 31, No. 8, 1113-1132 (2020). MSC: 68Q45 92D20 PDFBibTeX XMLCite \textit{J. A. Brzozowski} et al., Int. J. Found. Comput. Sci. 31, No. 8, 1113--1132 (2020; Zbl 1458.68091) Full Text: DOI
Caron, Pascal; Court, Edwin Hamel-De Le; Luque, Jean-Gabriel; Patrou, Bruno New tools for state complexity. (English) Zbl 1451.68144 Discrete Math. Theor. Comput. Sci. 22, No. 1, Paper No. 9, 18 p. (2020). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Caron} et al., Discrete Math. Theor. Comput. Sci. 22, No. 1, Paper No. 9, 18 p. (2020; Zbl 1451.68144) Full Text: DOI arXiv
Pascal, Caron; Court, Edwin Hamel-de le; Luque, Jean-Gabriel Algebraic and combinatorial tools for state complexity : application to the star-Xor problem. (English) Zbl 07453083 Leroux, Jérôme (ed.) et al., Proceedings of the tenth international symposium on games, automata, logics, and formal verification, GandALF 2019, Bordeaux, France, September 2–3, 2019. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 305, 154-168 (2019). MSC: 68Q45 68Q60 91A80 PDFBibTeX XMLCite \textit{C. Pascal} et al., Electron. Proc. Theor. Comput. Sci. (EPTCS) 305, 154--168 (2019; Zbl 07453083) Full Text: arXiv Link
Brzozowski, Janusz A.; Davies, Sylvie Most complex non-returning regular languages. (English) Zbl 1427.68139 Int. J. Found. Comput. Sci. 30, No. 6-7, 921-957 (2019). MSC: 68Q45 20M35 PDFBibTeX XMLCite \textit{J. A. Brzozowski} and \textit{S. Davies}, Int. J. Found. Comput. Sci. 30, No. 6--7, 921--957 (2019; Zbl 1427.68139) Full Text: DOI
Caron, Pascal; Luque, Jean-Gabriel; Patrou, Bruno State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures. (English) Zbl 1436.68164 Theor. Comput. Sci. 800, 15-30 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Caron} et al., Theor. Comput. Sci. 800, 15--30 (2019; Zbl 1436.68164) Full Text: DOI
Szykuła, Marek; Wittnebel, John Syntactic complexity of bifix-free regular languages. (English) Zbl 1429.68136 Theor. Comput. Sci. 787, 45-76 (2019). MSC: 68Q45 20M35 PDFBibTeX XMLCite \textit{M. Szykuła} and \textit{J. Wittnebel}, Theor. Comput. Sci. 787, 45--76 (2019; Zbl 1429.68136) Full Text: DOI
Ferens, Robert; Szykuła, Marek Complexity of bifix-free regular languages. (English) Zbl 1429.68110 Theor. Comput. Sci. 787, 14-27 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{R. Ferens} and \textit{M. Szykuła}, Theor. Comput. Sci. 787, 14--27 (2019; Zbl 1429.68110) Full Text: DOI arXiv
Brzozowski, Janusz A.; Sinnamon, Corwin Complexity of proper prefix-convex regular languages. (English) Zbl 1429.68101 Theor. Comput. Sci. 787, 2-13 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. A. Brzozowski} and \textit{C. Sinnamon}, Theor. Comput. Sci. 787, 2--13 (2019; Zbl 1429.68101) Full Text: DOI Link
Gonze, François; Gusev, Vladimir V.; Jungers, Raphaël M.; Gerencsér, Balázs; Volkov, Mikhail V. On the interplay between Černý and Babai’s conjectures. (English) Zbl 1415.68129 Int. J. Found. Comput. Sci. 30, No. 1, 93-114 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Gonze} et al., Int. J. Found. Comput. Sci. 30, No. 1, 93--114 (2019; Zbl 1415.68129) Full Text: DOI arXiv
Davies, Sylvie Primitivity, uniform minimality, and state complexity of Boolean operations. (English) Zbl 1430.68142 Theory Comput. Syst. 62, No. 8, 1952-2005 (2018). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. Davies}, Theory Comput. Syst. 62, No. 8, 1952--2005 (2018; Zbl 1430.68142) Full Text: DOI arXiv
Brzozowski, Janusz A.; Szykuła, Marek; Ye, Yuli Syntactic complexity of regular ideals. (English) Zbl 1398.68301 Theory Comput. Syst. 62, No. 5, 1175-1202 (2018). MSC: 68Q45 20M35 68Q70 PDFBibTeX XMLCite \textit{J. A. Brzozowski} et al., Theory Comput. Syst. 62, No. 5, 1175--1202 (2018; Zbl 1398.68301) Full Text: DOI arXiv
Brzozowski, Janusz A.; Szykuła, Marek Complexity of suffix-free regular languages. (English) Zbl 1372.68155 J. Comput. Syst. Sci. 89, 270-287 (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. A. Brzozowski} and \textit{M. Szykuła}, J. Comput. Syst. Sci. 89, 270--287 (2017; Zbl 1372.68155) Full Text: DOI arXiv Link
Szykuła, Marek; Wittnebel, John Syntactic complexity of bifix-free languages. (English) Zbl 1429.68135 Carayol, Arnaud (ed.) et al., Implementation and application of automata. 22nd international conference, CIAA 2017, Marne-la-Vallée, France, June 27–30, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10329, 201-212 (2017). MSC: 68Q45 20M35 PDFBibTeX XMLCite \textit{M. Szykuła} and \textit{J. Wittnebel}, Lect. Notes Comput. Sci. 10329, 201--212 (2017; Zbl 1429.68135) Full Text: DOI arXiv
Ferens, Robert; Szykuła, Marek Complexity of bifix-free regular languages. (English) Zbl 1429.68109 Carayol, Arnaud (ed.) et al., Implementation and application of automata. 22nd international conference, CIAA 2017, Marne-la-Vallée, France, June 27–30, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10329, 76-88 (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{R. Ferens} and \textit{M. Szykuła}, Lect. Notes Comput. Sci. 10329, 76--88 (2017; Zbl 1429.68109) Full Text: DOI
Brzozowski, Janusz A.; Sinnamon, Corwin Complexity of proper prefix-convex regular languages. (English) Zbl 1429.68100 Carayol, Arnaud (ed.) et al., Implementation and application of automata. 22nd international conference, CIAA 2017, Marne-la-Vallée, France, June 27–30, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10329, 52-63 (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. A. Brzozowski} and \textit{C. Sinnamon}, Lect. Notes Comput. Sci. 10329, 52--63 (2017; Zbl 1429.68100) Full Text: DOI Link
Brzozowski, Janusz A.; Sinnamon, Corwin Complexity of left-ideal, suffix-closed and suffix-free regular languages. (English) Zbl 1485.68138 Drewes, Frank (ed.) et al., Language and automata theory and applications. 11th international conference, LATA 2017, Umeå, Sweden, March 6–9, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10168, 171-182 (2017). MSC: 68Q45 20M35 PDFBibTeX XMLCite \textit{J. A. Brzozowski} and \textit{C. Sinnamon}, Lect. Notes Comput. Sci. 10168, 171--182 (2017; Zbl 1485.68138) Full Text: DOI arXiv
Palmovský, Matúš Kleene closure and state complexity. (English) Zbl 1357.68107 RAIRO, Theor. Inform. Appl. 50, No. 3, 251-261 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Palmovský}, RAIRO, Theor. Inform. Appl. 50, No. 3, 251--261 (2016; Zbl 1357.68107) Full Text: DOI
Caron, Pascal; Luque, Jean-Gabriel; Mignot, Ludovic; Patrou, Bruno State complexity of catenation combined with a Boolean operation: a unified approach. (English) Zbl 1351.68137 Int. J. Found. Comput. Sci. 27, No. 6, 675-703 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Caron} et al., Int. J. Found. Comput. Sci. 27, No. 6, 675--703 (2016; Zbl 1351.68137) Full Text: DOI arXiv
Brzozowski, Janusz Unrestricted state complexity of binary operations on regular languages. (English) Zbl 1476.68126 Câmpeanu, Cezar (ed.) et al., Descriptional complexity of formal systems. 18th IFIP WG 1.2 international conference, DCFS 2016, Bucharest, Romania, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9777, 60-72 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Brzozowski}, Lect. Notes Comput. Sci. 9777, 60--72 (2016; Zbl 1476.68126) Full Text: DOI arXiv
Jirásek, Jozef; Jirásková, Galina; Krausová, Monika; Mlynárčik, Peter; Šebej, Juraj Prefix-free languages: left and right quotient and reversal. (English) Zbl 1338.68151 Theor. Comput. Sci. 610, Part A, 78-90 (2016). Reviewer: Andreas Maletti (Stuttgart) MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Jirásek} et al., Theor. Comput. Sci. 610, Part A, 78--90 (2016; Zbl 1338.68151) Full Text: DOI
Brzozowski, Janusz; Szykuła, Marek Large aperiodic semigroups. (English) Zbl 1330.68147 Int. J. Found. Comput. Sci. 26, No. 7, 913-931 (2015). MSC: 68Q45 20M35 PDFBibTeX XMLCite \textit{J. Brzozowski} and \textit{M. Szykuła}, Int. J. Found. Comput. Sci. 26, No. 7, 913--931 (2015; Zbl 1330.68147) Full Text: DOI
Brzozowski, Janusz; Szykuła, Marek Complexity of suffix-free regular languages. (English) Zbl 1434.68239 Kosowski, Adrian (ed.) et al., Fundamentals of computation theory. 20th international symposium, FCT 2015, Gdańsk, Poland, August 17–19, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9210, 146-159 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Brzozowski} and \textit{M. Szykuła}, Lect. Notes Comput. Sci. 9210, 146--159 (2015; Zbl 1434.68239) Full Text: DOI Link