Hospodár, Michal; Jirásková, Galina Operational complexity in subregular classes. (English) Zbl 07810931 Nagy, Benedek (ed.), Implementation and application of automata. 27th international conference, CIAA 2023, Famagusta, North Cyprus, September 19–22, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14151, 153-165 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Hospodár} and \textit{G. Jirásková}, Lect. Notes Comput. Sci. 14151, 153--165 (2023; Zbl 07810931) Full Text: DOI
Hoffmann, Stefan Binary and circular automata having maximal state complexity for the set of synchronizing words. (English) Zbl 07798812 Inf. Comput. 295, Part A, Article ID 105076, 14 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Hoffmann}, Inf. Comput. 295, Part A, Article ID 105076, 14 p. (2023; Zbl 07798812) Full Text: DOI
Hoffmann, Stefan State complexity of permutation and the language inclusion problem up to Parikh equivalence on alphabetical pattern constraints and partially ordered NFAs. (English) Zbl 07770237 Int. J. Found. Comput. Sci. 34, No. 8, 959-986 (2023). MSC: 68Qxx 20Mxx 68-XX PDFBibTeX XMLCite \textit{S. Hoffmann}, Int. J. Found. Comput. Sci. 34, No. 8, 959--986 (2023; Zbl 07770237) Full Text: DOI
Okhotin, Alexander; Sazhneva, Elizaveta State complexity of GF(2)-inverse and GF(2)-star on binary languages. (English) Zbl 07770054 J. Autom. Lang. Comb. 28, No. 1-3, 121-141 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. Okhotin} and \textit{E. Sazhneva}, J. Autom. Lang. Comb. 28, No. 1--3, 121--141 (2023; Zbl 07770054) Full Text: Link
Hoffmann, Stefan State complexity bounds for the commutative closure of group languages. (English) Zbl 07770051 J. Autom. Lang. Comb. 28, No. 1-3, 27-57 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. Hoffmann}, J. Autom. Lang. Comb. 28, No. 1--3, 27--57 (2023; Zbl 07770051) Full Text: Link
Hoffmann, Stefan Completely distinguishable automata and the set of synchronizing words. (English) Zbl 07766939 Drewes, Frank (ed.) et al., Developments in language theory. 27th international conference, DLT 2023, Umeå, Sweden, June 12–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13911, 128-142 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. Hoffmann}, Lect. Notes Comput. Sci. 13911, 128--142 (2023; Zbl 07766939) Full Text: DOI
Caron, Pascal; Durand, Alexandre; Patrou, Bruno The exact state complexity for the composition of root and reversal. (English) Zbl 07766935 Drewes, Frank (ed.) et al., Developments in language theory. 27th international conference, DLT 2023, Umeå, Sweden, June 12–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13911, 74-85 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Caron} et al., Lect. Notes Comput. Sci. 13911, 74--85 (2023; Zbl 07766935) Full Text: DOI
Hospodár, Michal; Jirásek, Jozef; Jirásková, Galina; Šebej, Juraj Operational complexity: NFA-to-DFA trade-off. (English) Zbl 07729459 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, 79-93 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Hospodár} et al., Lect. Notes Comput. Sci. 13918, 79--93 (2023; Zbl 07729459) Full Text: DOI
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
D’Agostino, Giovanna; Martincigh, Davide; Policriti, Alberto Ordering regular languages and automata: complexity. (English) Zbl 07657062 Theor. Comput. Sci. 949, Article ID 113709, 19 p. (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{G. D'Agostino} et al., Theor. Comput. Sci. 949, Article ID 113709, 19 p. (2023; Zbl 07657062) Full Text: DOI arXiv
Hemaspaandra, Edith; Narváez, David E. Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification. (English) Zbl 07691303 Buzzard, Kevin (ed.) et al., Intelligent computer mathematics. 15th international conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13467, 241-255 (2022). MSC: 68Vxx PDFBibTeX XMLCite \textit{E. Hemaspaandra} and \textit{D. E. Narváez}, Lect. Notes Comput. Sci. 13467, 241--255 (2022; Zbl 07691303) Full Text: DOI
Kim, Sungmin; Han, Yo-Sub; Ko, Sang-Ki; Salomaa, Kai On Simon’s congruence closure of a string. (English) Zbl 07643468 Han, Yo-Sub (ed.) et al., Descriptional complexity of formal systems. 24th IFIP WG 1.02 international conference, DCFS 2022, Debrecen, Hungary, August 29–31, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13439, 127-141 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Kim} et al., Lect. Notes Comput. Sci. 13439, 127--141 (2022; Zbl 07643468) Full Text: DOI
Dassow, Jürgen; Jecker, Ismaël Operational complexity and pumping lemmas. (English) Zbl 07578090 Acta Inf. 59, No. 4, 337-355 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Dassow} and \textit{I. Jecker}, Acta Inf. 59, No. 4, 337--355 (2022; Zbl 07578090) Full Text: DOI
Pighizzini, Giovanni; Prigioniero, Luca; Sádovský, Šimon Performing regular operations with 1-limited automata. (English) Zbl 07571013 Diekert, Volker (ed.) et al., Developments in language theory. 26th international conference, DLT 2022, Tampa, FL, USA, May 9–13, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13257, 239-250 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{G. Pighizzini} et al., Lect. Notes Comput. Sci. 13257, 239--250 (2022; Zbl 07571013) Full Text: DOI
Okhotin, Alexander; Sazhneva, Elizaveta State complexity of GF(2)-operations on unary languages. (English) Zbl 07488459 Inf. Comput. 284, Article ID 104693, 15 p. (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Okhotin} and \textit{E. Sazhneva}, Inf. Comput. 284, Article ID 104693, 15 p. (2022; Zbl 07488459) Full Text: DOI
Bakinova, Ekaterina; Basharin, Artem; Batmanov, Igor; Lyubort, Konstantin; Okhotin, Alexander; Sazhneva, Elizaveta Formal languages over GF(2). (English) Zbl 07488445 Inf. Comput. 283, Article ID 104672, 19 p. (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{E. Bakinova} et al., Inf. Comput. 283, Article ID 104672, 19 p. (2022; Zbl 07488445) Full Text: DOI
Dassow, Jürgen Further remarks on the operational nonterminal complexity. (English) Zbl 1522.68263 Int. J. Found. Comput. Sci. 32, No. 5, 439-453 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Dassow}, Int. J. Found. Comput. Sci. 32, No. 5, 439--453 (2021; Zbl 1522.68263) Full Text: DOI
Hoffmann, Stefan State complexity investigations on commutative languages – the upward and downward closure, commutative aperiodic and commutative group languages. (English) Zbl 07614742 Han, Yo-Sub (ed.) et al., Descriptional complexity of formal systems. 23rd IFIP WG 1.02 international conference, DCFS 2021, virtual event, September 5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13037, 64-75 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Hoffmann}, Lect. Notes Comput. Sci. 13037, 64--75 (2021; Zbl 07614742) Full Text: DOI arXiv
Hoffmann, Stefan Commutative regular languages with product-form minimal automata. (English) Zbl 07614741 Han, Yo-Sub (ed.) et al., Descriptional complexity of formal systems. 23rd IFIP WG 1.02 international conference, DCFS 2021, virtual event, September 5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13037, 51-63 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Hoffmann}, Lect. Notes Comput. Sci. 13037, 51--63 (2021; Zbl 07614741) Full Text: DOI arXiv
Hoffmann, Stefan State complexity of projection on languages recognized by permutation automata and commuting letters. (English) Zbl 07498726 Moreira, Nelma (ed.) et al., Developments in language theory. 25th international conference, DLT 2021, Porto, Portugal, August 16–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12811, 192-203 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. Hoffmann}, Lect. Notes Comput. Sci. 12811, 192--203 (2021; Zbl 07498726) Full Text: DOI arXiv
Hoffmann, Stefan State complexity of permutation and related decision problems on alphabetical pattern constraints. (English) Zbl 07495109 Maneth, Sebastian (ed.), Implementation and application of automata. 25th international conference, CIAA 2021, virtual event, July 19–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12803, 115-126 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. Hoffmann}, Lect. Notes Comput. Sci. 12803, 115--126 (2021; Zbl 07495109) Full Text: DOI arXiv
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
Hospodár, Michal Power, positive closure, and quotients on convex languages. (English) Zbl 1504.68103 Theor. Comput. Sci. 870, 53-74 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Hospodár}, Theor. Comput. Sci. 870, 53--74 (2021; Zbl 1504.68103) Full Text: DOI
Hospodár, Michal; Mlynárčik, Peter Operations on permutation automata. (English) Zbl 07601066 Jonoska, Nataša (ed.) et al., Developments in language theory. 24th international conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12086, 122-136 (2020). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Hospodár} and \textit{P. Mlynárčik}, Lect. Notes Comput. Sci. 12086, 122--136 (2020; Zbl 07601066) Full Text: DOI
Caron, Pascal; Luque, Jean-Gabriel; Patrou, Bruno A combinatorial approach for the state complexity of the shuffle product. (English) Zbl 1504.68097 J. Autom. Lang. Comb. 25, No. 4, 291-320 (2020). MSC: 68Q45 68R05 PDFBibTeX XMLCite \textit{P. Caron} et al., J. Autom. Lang. Comb. 25, No. 4, 291--320 (2020; Zbl 1504.68097) Full Text: arXiv Link
Hospodár, Michal; Holzer, Markus The ranges of accepting state complexities of languages resulting from some operations. (English) Zbl 1482.68126 Int. J. Found. Comput. Sci. 31, No. 8, 1159-1177 (2020). Reviewer: Andreas Maletti (Leipzig) MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Hospodár} and \textit{M. Holzer}, Int. J. Found. Comput. Sci. 31, No. 8, 1159--1177 (2020; Zbl 1482.68126) 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
Jirásková, Galina; Krajňáková, Ivana Square on deterministic, alternating, and Boolean finite automata. (English) Zbl 1427.68147 Int. J. Found. Comput. Sci. 30, No. 6-7, 1117-1134 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{G. Jirásková} and \textit{I. Krajňáková}, Int. J. Found. Comput. Sci. 30, No. 6--7, 1117--1134 (2019; Zbl 1427.68147) Full Text: DOI
Holzer, Markus; Kutrib, Martin One-time nondeterministic computations. (English) Zbl 1427.68145 Int. J. Found. Comput. Sci. 30, No. 6-7, 1069-1089 (2019). MSC: 68Q45 68Q10 PDFBibTeX XMLCite \textit{M. Holzer} and \textit{M. Kutrib}, Int. J. Found. Comput. Sci. 30, No. 6--7, 1069--1089 (2019; Zbl 1427.68145) Full Text: DOI
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
Jirásková, Galina; Okhotin, Alexander State complexity of unambiguous operations on finite automata. (English) Zbl 1435.68170 Theor. Comput. Sci. 798, 52-64 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{G. Jirásková} and \textit{A. Okhotin}, Theor. Comput. Sci. 798, 52--64 (2019; Zbl 1435.68170) Full Text: DOI
Hospodár, Michal; Jirásková, Galina; Mlynárčik, Peter Nondeterministic complexity in subclasses of convex languages. (English) Zbl 1429.68118 Theor. Comput. Sci. 787, 89-110 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Hospodár} et al., Theor. Comput. Sci. 787, 89--110 (2019; Zbl 1429.68118) Full Text: DOI
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
Hospodár, Michal; Jirásková, Galina; Mlynárčik, Peter Descriptional complexity of the forever operator. (English) Zbl 1415.68130 Int. J. Found. Comput. Sci. 30, No. 1, 115-134 (2019). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Hospodár} et al., Int. J. Found. Comput. Sci. 30, No. 1, 115--134 (2019; Zbl 1415.68130) Full Text: DOI
Brzozowski, Janusz A.; Davies, Sylvie; Madan, Abhishek State complexity of pattern matching in regular languages. (English) Zbl 1425.68184 Theor. Comput. Sci. 777, 121-131 (2019). MSC: 68Q45 68Q70 PDFBibTeX XMLCite \textit{J. A. Brzozowski} et al., Theor. Comput. Sci. 777, 121--131 (2019; Zbl 1425.68184) Full Text: DOI arXiv
Kutrib, Martin; Malcher, Andreas Cellular automata: descriptional complexity and decidability. (English) Zbl 1434.68316 Adamatzky, Andrew (ed.), Reversibility and universality. Essays presented to Kenichi Morita on the occasion of his 70th birthday. Cham: Springer. Emerg. Complex. Comput. 30, 129-168 (2018). MSC: 68Q80 03B25 PDFBibTeX XMLCite \textit{M. Kutrib} and \textit{A. Malcher}, Emerg. Complex. Comput. 30, 129--168 (2018; Zbl 1434.68316) Full Text: DOI
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
Hospodár, Michal; Jirásková, Galina The complexity of concatenation on deterministic and alternating finite automata. (English) Zbl 1486.68096 RAIRO, Theor. Inform. Appl. 52, No. 2-4, 153-168 (2018). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Hospodár} and \textit{G. Jirásková}, RAIRO, Theor. Inform. Appl. 52, No. 2--4, 153--168 (2018; Zbl 1486.68096) Full Text: DOI
Jirásek, Jozef jun.; Jirásková, Galina; Šebej, Juraj Operations on unambiguous finite automata. (English) Zbl 1403.68115 Int. J. Found. Comput. Sci. 29, No. 5, 861-876 (2018). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Jirásek jun.} et al., Int. J. Found. Comput. Sci. 29, No. 5, 861--876 (2018; Zbl 1403.68115) Full Text: DOI
Otto, Friedrich; Kwee, Kent On the descriptional complexity of stateless deterministic ordered restarting automata. (English) Zbl 1390.68412 Inf. Comput. 259, Part 2, 277-302 (2018). MSC: 68Q45 03D05 PDFBibTeX XMLCite \textit{F. Otto} and \textit{K. Kwee}, Inf. Comput. 259, Part 2, 277--302 (2018; Zbl 1390.68412) Full Text: DOI
Ebrahimnejad, Farzam On the gap between separating words and separating their reversals. (English) Zbl 1390.68390 Theor. Comput. Sci. 711, 79-91 (2018). Reviewer: Francesco Dolce (Montréal) MSC: 68Q45 68R15 PDFBibTeX XMLCite \textit{F. Ebrahimnejad}, Theor. Comput. Sci. 711, 79--91 (2018; Zbl 1390.68390) Full Text: DOI arXiv
Axelsen, Holger Bock; Holzer, Markus; Kutrib, Martin The degree of irreversibility in deterministic finite automata. (English) Zbl 1380.68244 Int. J. Found. Comput. Sci. 28, No. 5, 503-522 (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{H. B. Axelsen} et al., Int. J. Found. Comput. Sci. 28, No. 5, 503--522 (2017; Zbl 1380.68244) Full Text: DOI
Bednárová, Zuzana; Geffert, Viliam; Mereghetti, Carlo; Palano, Beatrice Boolean language operations on nondeterministic automata with a pushdown of constant height. (English) Zbl 1374.68251 J. Comput. Syst. Sci. 90, 99-114 (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{Z. Bednárová} et al., J. Comput. Syst. Sci. 90, 99--114 (2017; Zbl 1374.68251) Full Text: DOI
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
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
Cho, Da-Jung; Goč, Daniel; Han, Yo-Sub; Ko, Sang-Ki; Palioudakis, Alexandros; Salomaa, Kai State complexity of permutation on finite languages over a binary alphabet. (English) Zbl 1371.68145 Theor. Comput. Sci. 682, 67-78 (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{D.-J. Cho} et al., Theor. Comput. Sci. 682, 67--78 (2017; Zbl 1371.68145) Full Text: DOI
Bednárová, Zuzana; Geffert, Viliam Two double-exponential gaps for automata with a limited pushdown. (English) Zbl 1370.68157 Inf. Comput. 253, Part 3, 381-398 (2017). MSC: 68Q45 PDFBibTeX XMLCite \textit{Z. Bednárová} and \textit{V. Geffert}, Inf. Comput. 253, Part 3, 381--398 (2017; Zbl 1370.68157) Full Text: DOI
Jirásková, Galina; Okhotin, Alexander On the state complexity of operations on two-way finite automata. (English) Zbl 1371.68153 Inf. Comput. 253, Part 1, 36-63 (2017). Reviewer: Andreas Maletti (Leipzig) MSC: 68Q45 PDFBibTeX XMLCite \textit{G. Jirásková} and \textit{A. Okhotin}, Inf. Comput. 253, Part 1, 36--63 (2017; Zbl 1371.68153) Full Text: DOI
Steinert-Threlkeld, Shane Some properties of iterated languages. (English) Zbl 1396.03083 J. Logic Lang. Inf. 25, No. 2, 191-213 (2016). MSC: 03D05 03C80 68Q45 PDFBibTeX XMLCite \textit{S. Steinert-Threlkeld}, J. Logic Lang. Inf. 25, No. 2, 191--213 (2016; Zbl 1396.03083) Full Text: DOI
Ko, Sang-Ki; Lee, Ha-Rim; Han, Yo-Sub State complexity of regular tree languages for tree matching. (English) Zbl 1364.68251 Int. J. Found. Comput. Sci. 27, No. 8, 965-979 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{S.-K. Ko} et al., Int. J. Found. Comput. Sci. 27, No. 8, 965--979 (2016; Zbl 1364.68251) Full Text: DOI
Han, Yo-Sub; Ko, Sang-Ki; Ng, Timothy; Salomaa, Kai State complexity of insertion. (English) Zbl 1404.68069 Int. J. Found. Comput. Sci. 27, No. 7, 863-878 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{Y.-S. Han} et al., Int. J. Found. Comput. Sci. 27, No. 7, 863--878 (2016; Zbl 1404.68069) Full Text: DOI
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
Ko, Sang-Ki; Eom, Hae-Sung; Han, Yo-Sub Operational state complexity of subtree-free regular tree languages. (English) Zbl 1351.68142 Int. J. Found. Comput. Sci. 27, No. 6, 705-724 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{S.-K. Ko} et al., Int. J. Found. Comput. Sci. 27, No. 6, 705--724 (2016; Zbl 1351.68142) 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
Axelsen, Holger Bock; Holzer, Markus; Kutrib, Martin The degree of irreversibility in deterministic finite automata. (English) Zbl 1379.68210 Han, Yo-Sub (ed.) et al., Implementation and application of automata. 21st international conference, CIAA 2016, Seoul, South Korea, July 19–22, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-40945-0/pbk; 978-3-319-40946-7/ebook). Lecture Notes in Computer Science 9705, 15-26 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{H. B. Axelsen} et al., Lect. Notes Comput. Sci. 9705, 15--26 (2016; Zbl 1379.68210) Full Text: DOI
Jirásková, Galina; Szabari, Alexander; Šebej, Juraj The complexity of languages resulting from the concatenation operation. (English) Zbl 1476.68132 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, 153-167 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{G. Jirásková} et al., Lect. Notes Comput. Sci. 9777, 153--167 (2016; Zbl 1476.68132) Full Text: DOI HAL
Herrmann, Andrea; Kutrib, Martin; Malcher, Andreas; Wendlandt, Matthias Descriptional complexity of bounded regular languages. (English) Zbl 1476.68130 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, 138-152 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. Herrmann} et al., Lect. Notes Comput. Sci. 9777, 138--152 (2016; Zbl 1476.68130) Full Text: DOI HAL
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ásková, Galina Self-verifying finite automata and descriptional complexity. (English) Zbl 1476.68131 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, 29-44 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{G. Jirásková}, Lect. Notes Comput. Sci. 9777, 29--44 (2016; Zbl 1476.68131) Full Text: DOI HAL
Jirásek, Jozef jun.; Jirásková, Galina; Šebej, Juraj Operations on unambiguous finite automata. (English) Zbl 1436.68176 Brlek, Srečko (ed.) et al., Developments in language theory. 20th international conference, DLT 2016, Montréal, Canada, July 25–28, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9840, 243-255 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Jirásek jun.} et al., Lect. Notes Comput. Sci. 9840, 243--255 (2016; Zbl 1436.68176) Full Text: DOI
Losemann, Katja; Martens, Wim; Niewerth, Matthias Closure properties and descriptional complexity of deterministic regular expressions. (English) Zbl 1338.68154 Theor. Comput. Sci. 627, 54-70 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{K. Losemann} et al., Theor. Comput. Sci. 627, 54--70 (2016; Zbl 1338.68154) Full Text: DOI
Han, Yo-Sub; Ko, Sang-Ki; Salomaa, Kai State complexity of deletion and bipolar deletion. (English) Zbl 1335.68121 Acta Inf. 53, No. 1, 67-85 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{Y.-S. Han} et al., Acta Inf. 53, No. 1, 67--85 (2016; Zbl 1335.68121) Full Text: DOI Link
Palioudakis, Alexandros; Salomaa, Kai; Akl, Selim G. Operational state complexity of unary NFAs with finite nondeterminism. (English) Zbl 1332.68125 Theor. Comput. Sci. 610, Part A, 108-120 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. Palioudakis} et al., Theor. Comput. Sci. 610, Part A, 108--120 (2016; Zbl 1332.68125) Full Text: DOI
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
Cho, Da-Jung; Han, Yo-Sub; Ko, Sang-Ki; Salomaa, Kai State complexity of inversion operations. (English) Zbl 1332.68110 Theor. Comput. Sci. 610, Part A, 2-12 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{D.-J. Cho} et al., Theor. Comput. Sci. 610, Part A, 2--12 (2016; Zbl 1332.68110) Full Text: DOI
Ray, Kumar Sankar; Chatterjee, Kingshuk; Ganguly, Debayan State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata. (English) Zbl 1415.68137 Nat. Comput. 14, No. 4, 691-699 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{K. S. Ray} et al., Nat. Comput. 14, No. 4, 691--699 (2015; Zbl 1415.68137) Full Text: DOI
Pighizzini, Giovanni Investigations on automata and languages over a unary alphabet. (English) Zbl 1330.68176 Int. J. Found. Comput. Sci. 26, No. 7, 827-850 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{G. Pighizzini}, Int. J. Found. Comput. Sci. 26, No. 7, 827--850 (2015; Zbl 1330.68176) Full Text: DOI
Eom, Hae-Sung; Han, Yo-Sub State complexity of boundary of prefix-free regular languages. (English) Zbl 1430.68143 Int. J. Found. Comput. Sci. 26, No. 6, 697-707 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{H.-S. Eom} and \textit{Y.-S. Han}, Int. J. Found. Comput. Sci. 26, No. 6, 697--707 (2015; Zbl 1430.68143) 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
Maia, Eva; Moreira, Nelma; Reis, Rogério Incomplete operational transition complexity of regular languages. (English) Zbl 1329.68165 Inf. Comput. 244, 1-22 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{E. Maia} et al., Inf. Comput. 244, 1--22 (2015; Zbl 1329.68165) Full Text: DOI
Palmovský, Matúš; Šebej, Juraj Star-complement-star on prefix-free languages. (English) Zbl 1356.68134 Shallit, Jeffrey (ed.) et al., Descriptional complexity of formal systems. 17th international workshop, DCFS 2015, Waterloo, ON, Canada, June 25–27, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-19224-6/pbk; 978-3-319-19225-3/ebook). Lecture Notes in Computer Science 9118, 231-242 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Palmovský} and \textit{J. Šebej}, Lect. Notes Comput. Sci. 9118, 231--242 (2015; Zbl 1356.68134) Full Text: DOI
Palioudakis, Alexandros; Cho, Da-Jung; Goč, Daniel; Han, Yo-Sub; Ko, Sang-Ki; Salomaa, Kai The state complexity of permutations on finite languages over binary alphabets. (English) Zbl 1432.68241 Shallit, Jeffrey (ed.) et al., Descriptional complexity of formal systems. 17th international workshop, DCFS 2015, Waterloo, ON, Canada, June 25–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9118, 220-230 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. Palioudakis} et al., Lect. Notes Comput. Sci. 9118, 220--230 (2015; Zbl 1432.68241) Full Text: DOI
Moreira, Nelma; Pighizzini, Giovanni; Reis, Rogério Universal disjunctive concatenation and star. (English) Zbl 1432.68236 Shallit, Jeffrey (ed.) et al., Descriptional complexity of formal systems. 17th international workshop, DCFS 2015, Waterloo, ON, Canada, June 25–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9118, 197-208 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{N. Moreira} et al., Lect. Notes Comput. Sci. 9118, 197--208 (2015; Zbl 1432.68236) Full Text: DOI Link
Čevorová, Kristína Square on ideal, closed and free languages. (English) Zbl 1432.68220 Shallit, Jeffrey (ed.) et al., Descriptional complexity of formal systems. 17th international workshop, DCFS 2015, Waterloo, ON, Canada, June 25–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9118, 70-80 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{K. Čevorová}, Lect. Notes Comput. Sci. 9118, 70--80 (2015; Zbl 1432.68220) Full Text: DOI
Eom, Hae-Sung; Han, Yo-Sub; Salomaa, Kai State complexity of \(k\)-union and \(k\)-intersection for prefix-free regular languages. (English) Zbl 1327.68155 Int. J. Found. Comput. Sci. 26, No. 2, 211-227 (2015). Reviewer: Magnus Steinby (Turku) MSC: 68Q45 PDFBibTeX XMLCite \textit{H.-S. Eom} et al., Int. J. Found. Comput. Sci. 26, No. 2, 211--227 (2015; Zbl 1327.68155) Full Text: DOI
Jirásek, Jozef; Jirásková, Galina On the boundary of regular languages. (English) Zbl 1317.68098 Theor. Comput. Sci. 578, 42-57 (2015). Reviewer: Michal Kunc (Brno) MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Jirásek} and \textit{G. Jirásková}, Theor. Comput. Sci. 578, 42--57 (2015; Zbl 1317.68098) Full Text: DOI
Brzozowski, Janusz; Jirásková, Galina; Zou, Chenglong Quotient complexity of closed languages. (English) Zbl 1380.68249 Theory Comput. Syst. 54, No. 2, 277-292 (2014). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Brzozowski} et al., Theory Comput. Syst. 54, No. 2, 277--292 (2014; Zbl 1380.68249) Full Text: DOI arXiv
Goč, Daniel; Palioudakis, Alexandros; Salomaa, Kai Nondeterministic state complexity of proportional removals. (English) Zbl 1320.68110 Int. J. Found. Comput. Sci. 25, No. 7, 823-835 (2014). MSC: 68Q45 PDFBibTeX XMLCite \textit{D. Goč} et al., Int. J. Found. Comput. Sci. 25, No. 7, 823--835 (2014; Zbl 1320.68110) Full Text: DOI
Jirásková, Galina The ranges of state complexities for complement, star, and reversal of regular languages. (English) Zbl 1295.68146 Int. J. Found. Comput. Sci. 25, No. 1, 101-124 (2014). Reviewer: Michal Kunc (Brno) MSC: 68Q45 PDFBibTeX XMLCite \textit{G. Jirásková}, Int. J. Found. Comput. Sci. 25, No. 1, 101--124 (2014; Zbl 1295.68146) Full Text: DOI
Brzozowski, Janusz In search of most complex regular languages. (English) Zbl 1410.68199 Int. J. Found. Comput. Sci. 24, No. 6, 691-708 (2013). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Brzozowski}, Int. J. Found. Comput. Sci. 24, No. 6, 691--708 (2013; Zbl 1410.68199) Full Text: DOI
Eom, Hae-Sung; Han, Yo-Sub State complexity of combined operations for suffix-free regular languages. (English) Zbl 1358.68167 Theor. Comput. Sci. 510, 87-93 (2013). MSC: 68Q45 PDFBibTeX XMLCite \textit{H.-S. Eom} and \textit{Y.-S. Han}, Theor. Comput. Sci. 510, 87--93 (2013; Zbl 1358.68167) Full Text: DOI
Gao, Yuan; Kari, Lila State complexity of star of union and square of union on k regular languages. (English) Zbl 1296.68093 Theor. Comput. Sci. 499, 38-50 (2013). MSC: 68Q45 PDFBibTeX XMLCite \textit{Y. Gao} and \textit{L. Kari}, Theor. Comput. Sci. 499, 38--50 (2013; Zbl 1296.68093) Full Text: DOI
Salomaa, Arto; Salomaa, Kai; Yu, Sheng Undecidability of state complexity. (English) Zbl 1401.68167 Int. J. Comput. Math. 90, No. 6, 1310-1320 (2013). Reviewer: Michal Kunc (Brno) MSC: 68Q45 PDFBibTeX XMLCite \textit{A. Salomaa} et al., Int. J. Comput. Math. 90, No. 6, 1310--1320 (2013; Zbl 1401.68167) Full Text: DOI
Charlier, Émilie; Domaratzki, Mike; Harju, Tero; Shallit, Jeffrey Composition and orbits of language operations: finiteness and upper bounds. (English) Zbl 1361.68119 Int. J. Comput. Math. 90, No. 6, 1171-1196 (2013). MSC: 68Q45 20M35 PDFBibTeX XMLCite \textit{É. Charlier} et al., Int. J. Comput. Math. 90, No. 6, 1171--1196 (2013; Zbl 1361.68119) Full Text: DOI
Brzozowski, Janusz; Liu, Bo Quotient complexity of star-free languages. (English) Zbl 1272.68206 Int. J. Found. Comput. Sci. 23, No. 6, 1261-1276 (2012). MSC: 68Q45 68Q19 PDFBibTeX XMLCite \textit{J. Brzozowski} and \textit{B. Liu}, Int. J. Found. Comput. Sci. 23, No. 6, 1261--1276 (2012; Zbl 1272.68206) Full Text: DOI
Gao, Yuan; Yu, Sheng State complexity and approximation. (English) Zbl 1255.68094 Int. J. Found. Comput. Sci. 23, No. 5, 1085-1098 (2012). MSC: 68Q45 68Q19 PDFBibTeX XMLCite \textit{Y. Gao} and \textit{S. Yu}, Int. J. Found. Comput. Sci. 23, No. 5, 1085--1098 (2012; Zbl 1255.68094) Full Text: DOI
Salomaa, Arto Undecidability of state complexities using mirror images. (English) Zbl 1367.68177 Bordihn, Henning (ed.) et al., Languages alive. Essays dedicated to Jürgen Dassow on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-31643-2/pbk). Lecture Notes in Computer Science 7300, 221-235 (2012). MSC: 68Q45 03B25 03D05 PDFBibTeX XMLCite \textit{A. Salomaa}, Lect. Notes Comput. Sci. 7300, 221--235 (2012; Zbl 1367.68177) Full Text: DOI
Okhotin, Alexander; Piao, Xiaoxue; Salomaa, Kai Descriptional complexity of input-driven pushdown automata. (English) Zbl 1367.68176 Bordihn, Henning (ed.) et al., Languages alive. Essays dedicated to Jürgen Dassow on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-31643-2/pbk). Lecture Notes in Computer Science 7300, 186-206 (2012). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. Okhotin} et al., Lect. Notes Comput. Sci. 7300, 186--206 (2012; Zbl 1367.68176) Full Text: DOI
Gao, Yuan; Kari, Lila; Yu, Sheng State complexity of union and intersection of square and reversal on \(k\) regular languages. (English) Zbl 1281.68144 Theor. Comput. Sci. 454, 164-171 (2012). MSC: 68Q45 PDFBibTeX XMLCite \textit{Y. Gao} et al., Theor. Comput. Sci. 454, 164--171 (2012; Zbl 1281.68144) Full Text: DOI
Jirásková, Galina; Masopust, Tomáš On the state and computational complexity of the reverse of acyclic minimal DFAs. (English) Zbl 1297.68144 Moreira, Nelma (ed.) et al., Implementation and application of automata. 17th international conference, CIAA 2012, Porto, Portugal, July 17–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31605-0/pbk). Lecture Notes in Computer Science 7381, 229-239 (2012). MSC: 68Q45 68Q25 PDFBibTeX XMLCite \textit{G. Jirásková} and \textit{T. Masopust}, Lect. Notes Comput. Sci. 7381, 229--239 (2012; Zbl 1297.68144) Full Text: DOI
Cui, Bo; Gao, Yuan; Kari, Lila; Yu, Sheng State complexity of two combined operations: catenation-star and catenation-reversal. (English) Zbl 1279.68144 Int. J. Found. Comput. Sci. 23, No. 1, 51-66 (2012). MSC: 68Q45 PDFBibTeX XMLCite \textit{B. Cui} et al., Int. J. Found. Comput. Sci. 23, No. 1, 51--66 (2012; Zbl 1279.68144) Full Text: DOI
Kunc, Michal; Okhotin, Alexander State complexity of operations on two-way finite automata over a unary alphabet. (English) Zbl 1255.68078 Theor. Comput. Sci. 449, 106-118 (2012). MSC: 68Q19 68Q45 PDFBibTeX XMLCite \textit{M. Kunc} and \textit{A. Okhotin}, Theor. Comput. Sci. 449, 106--118 (2012; Zbl 1255.68078) Full Text: DOI
Jirásková, Galina; Šebej, Juraj Reversal of binary regular languages. (English) Zbl 1262.68045 Theor. Comput. Sci. 449, 85-92 (2012). MSC: 68Q19 68Q45 PDFBibTeX XMLCite \textit{G. Jirásková} and \textit{J. Šebej}, Theor. Comput. Sci. 449, 85--92 (2012; Zbl 1262.68045) Full Text: DOI
Bednárová, Zuzana; Geffert, Viliam; Mereghetti, Carlo; Palano, Beatrice The size-cost of Boolean operations on constant height deterministic pushdown automata. (English) Zbl 1272.68205 Theor. Comput. Sci. 449, 23-36 (2012). MSC: 68Q45 68Q19 PDFBibTeX XMLCite \textit{Z. Bednárová} et al., Theor. Comput. Sci. 449, 23--36 (2012; Zbl 1272.68205) Full Text: DOI
Castaño, José M.; Castaño, Rodrigo A finite state intersection approach to propositional satisfiability. (English) Zbl 1243.68272 Theor. Comput. Sci. 450, 92-108 (2012). MSC: 68T20 68Q45 68T27 PDFBibTeX XMLCite \textit{J. M. Castaño} and \textit{R. Castaño}, Theor. Comput. Sci. 450, 92--108 (2012; Zbl 1243.68272) Full Text: DOI
Cui, Bo; Gao, Yuan; Kari, Lila; Yu, Sheng State complexity of combined operations with two basic operations. (English) Zbl 1276.68091 Theor. Comput. Sci. 437, 82-102 (2012). MSC: 68Q45 PDFBibTeX XMLCite \textit{B. Cui} et al., Theor. Comput. Sci. 437, 82--102 (2012; Zbl 1276.68091) Full Text: DOI
Piao, Xiaoxue; Salomaa, Kai State complexity of Kleene-star operations on trees. (English) Zbl 1353.68171 Dinneen, Michael J. (ed.) et al., Computation, physics and beyond. International workshop on theoretical computer science, WTCS 2012, dedicated to Cristian S. Calude on the occasion of his 60th birthday, Auckland, New Zealand, February 21–24, 2012. Revised selected and invited papers. Berlin: Springer (ISBN 978-3-642-27653-8/pbk). Lecture Notes in Computer Science 7160, 388-402 (2012). MSC: 68Q45 PDFBibTeX XMLCite \textit{X. Piao} and \textit{K. Salomaa}, Lect. Notes Comput. Sci. 7160, 388--402 (2012; Zbl 1353.68171) Full Text: DOI
Piao, Xiaoxue; Salomaa, Kai State complexity of the concatenation of regular tree languages. (English) Zbl 1238.68079 Theor. Comput. Sci. 429, 273-281 (2012). MSC: 68Q45 PDFBibTeX XMLCite \textit{X. Piao} and \textit{K. Salomaa}, Theor. Comput. Sci. 429, 273--281 (2012; Zbl 1238.68079) Full Text: DOI
Gao, Yuan; Kari, Lila; Yu, Sheng State complexity of union and intersection of star on \(k\) regular languages. (English) Zbl 1238.68075 Theor. Comput. Sci. 429, 98-107 (2012). MSC: 68Q45 PDFBibTeX XMLCite \textit{Y. Gao} et al., Theor. Comput. Sci. 429, 98--107 (2012; Zbl 1238.68075) Full Text: DOI