Wei, Zeming; Zhang, Xiyue; Zhang, Yihao; Sun, Meng Weighted automata extraction and explanation of recurrent neural networks for natural language tasks. (English) Zbl 07803170 J. Log. Algebr. Methods Program. 136, Article ID 100907, 18 p. (2024). MSC: 68-XX PDFBibTeX XMLCite \textit{Z. Wei} et al., J. Log. Algebr. Methods Program. 136, Article ID 100907, 18 p. (2024; Zbl 07803170) Full Text: DOI arXiv
Lingg, Jonas; de Oliveira Oliveira, Mateus; Wolf, Petra Learning from positive and negative examples: new proof for binary alphabets. (English) Zbl 07749688 Inf. Process. Lett. 183, Article ID 106427, 6 p. (2024). MSC: 68Q32 68Q17 68Q45 PDFBibTeX XMLCite \textit{J. Lingg} et al., Inf. Process. Lett. 183, Article ID 106427, 6 p. (2024; Zbl 07749688) Full Text: DOI arXiv
Nagy, Benedek On language classes accepted by stateless 5’ \(\to\) 3’ Watson-Crick finite automata. (English) Zbl 07822960 Ann. Math. Inform. 58, 110-120 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{B. Nagy}, Ann. Math. Inform. 58, 110--120 (2023; Zbl 07822960) Full Text: DOI
Inoue, Yusuke; Hashimoto, Kenji; Seki, Hiroyuki When is context-freeness distinguishable from regularity? An extension of Parikh’s theorem. (English) Zbl 07810932 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, 166-178 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{Y. Inoue} et al., Lect. Notes Comput. Sci. 14151, 166--178 (2023; Zbl 07810932) Full Text: DOI
Otto, Friedrich A survey on automata with translucent letters. (English) Zbl 07810922 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, 21-50 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Otto}, Lect. Notes Comput. Sci. 14151, 21--50 (2023; Zbl 07810922) Full Text: DOI
Geffert, Viliam Binary coded unary regular languages. (English) Zbl 07810921 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, 3-20 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{V. Geffert}, Lect. Notes Comput. Sci. 14151, 3--20 (2023; Zbl 07810921) Full Text: DOI
Sopronyuk, T. M.; Sopronyuk, A. Yu.; Drobot, A. V. Phases of constructing a language processor for the . NET platform. (English) Zbl 07799287 Bukovyn. Mat. Zh. 11, No. 2, 71-84 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{T. M. Sopronyuk} et al., Bukovyn. Mat. Zh. 11, No. 2, 71--84 (2023; Zbl 07799287) Full Text: DOI
Mráz, František; Otto, Friedrich Non-returning deterministic and nondeterministic finite automata with translucent letters. (English) Zbl 07799054 RAIRO, Theor. Inform. Appl. 57, Paper No. 8, 35 p. (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Mráz} and \textit{F. Otto}, RAIRO, Theor. Inform. Appl. 57, Paper No. 8, 35 p. (2023; Zbl 07799054) Full Text: DOI arXiv
Birkmann, Fabian; Milius, Stefan; Urbat, Henning Eilenberg’s variety theorem without Boolean operations. (English) Zbl 07798807 Inf. Comput. 295, Part A, Article ID 104916, 30 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. Birkmann} et al., Inf. Comput. 295, Part A, Article ID 104916, 30 p. (2023; Zbl 07798807) Full Text: DOI
Mrykhin, Mikhail; Okhotin, Alexander On hardest languages for one-dimensional cellular automata. (English) Zbl 07798805 Inf. Comput. 295, Part A, Article ID 104891, 17 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Mrykhin} and \textit{A. Okhotin}, Inf. Comput. 295, Part A, Article ID 104891, 17 p. (2023; Zbl 07798805) Full Text: DOI
Esparza, Javier; Blondin, Michael Automata theory. An algorithmic approach. (English) Zbl 07770922 Cambridge, MA: MIT Press (ISBN 978-0-262-04863-7/hbk; 978-0-262-37693-8/ebook). xii, 532 p., open access (2023). Reviewer: Ioan Tomescu (Bucureşti) MSC: 68-02 68-01 68P05 68Q45 68Q60 PDFBibTeX XMLCite \textit{J. Esparza} and \textit{M. Blondin}, Automata theory. An algorithmic approach. Cambridge, MA: MIT Press (2023; Zbl 07770922) Full Text: Link
Hoffmann, Stefan Regularity conditions for iterated shuffle on commutative regular languages. (English) Zbl 07770236 Int. J. Found. Comput. Sci. 34, No. 8, 923-957 (2023). MSC: 68Qxx 20Mxx 68-XX PDFBibTeX XMLCite \textit{S. Hoffmann}, Int. J. Found. Comput. Sci. 34, No. 8, 923--957 (2023; Zbl 07770236) Full Text: DOI
Lambert, Dakotah Relativized adjacency. (English) Zbl 07753647 J. Logic Lang. Inf. 32, No. 4, 707-731 (2023). MSC: 68Q19 68Q45 68Q70 20M35 PDFBibTeX XMLCite \textit{D. Lambert}, J. Logic Lang. Inf. 32, No. 4, 707--731 (2023; Zbl 07753647) Full Text: DOI
Gustafson, Paul; Im, Mee Seong; Kaldawy, Remy; Khovanov, Mikhail; Lihn, Zachary Automata and one-dimensional TQFTs with defects. (English) Zbl 07743387 Lett. Math. Phys. 113, No. 5, Paper No. 93, 38 p. (2023). MSC: 57K16 68Q45 18M10 18M30 06A12 68Q70 18B20 PDFBibTeX XMLCite \textit{P. Gustafson} et al., Lett. Math. Phys. 113, No. 5, Paper No. 93, 38 p. (2023; Zbl 07743387) Full Text: DOI arXiv
Kim, Sungmin; Han, Yo-Sub; Ko, Sang-Ki; Salomaa, Kai On Simon’s congruence closure of a string. (English) Zbl 1520.68059 Theor. Comput. Sci. 972, Article ID 114078, 14 p. (2023). MSC: 68Q45 68W32 PDFBibTeX XMLCite \textit{S. Kim} et al., Theor. Comput. Sci. 972, Article ID 114078, 14 p. (2023; Zbl 1520.68059) Full Text: DOI
Hospodár, Michal; Olejár, Viktor Nondeterministic operational complexity in subregular languages. (English) Zbl 07735120 Theor. Comput. Sci. 972, Article ID 114075, 23 p. (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Hospodár} and \textit{V. Olejár}, Theor. Comput. Sci. 972, Article ID 114075, 23 p. (2023; Zbl 07735120) Full Text: DOI
Bridoux, Florian; Perrot, Kévin; Marchetto, Aymeric Picard; Richard, Adrien Interaction graphs of isomorphic automata networks. I: Complete digraph and minimum in-degree. (English) Zbl 07730237 J. Comput. Syst. Sci. 138, Article ID 103458, 16 p. (2023). MSC: 68R10 68Q45 PDFBibTeX XMLCite \textit{F. Bridoux} et al., J. Comput. Syst. Sci. 138, Article ID 103458, 16 p. (2023; Zbl 07730237) Full Text: DOI arXiv
Holzer, Markus; Rauch, Christian On Jaffe’s pumping lemma, revisited. (English) Zbl 07729458 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, 65-78 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Holzer} and \textit{C. Rauch}, Lect. Notes Comput. Sci. 13918, 65--78 (2023; Zbl 07729458) Full Text: DOI
Mrykhin, Mikhail; Okhotin, Alexander The hardest \(\operatorname{LL}(k)\) language. (English) Zbl 07727037 Int. J. Found. Comput. Sci. 34, No. 2-3, 289-319 (2023). MSC: 68Q45 68Q42 PDFBibTeX XMLCite \textit{M. Mrykhin} and \textit{A. Okhotin}, Int. J. Found. Comput. Sci. 34, No. 2--3, 289--319 (2023; Zbl 07727037) Full Text: DOI
Henriksson, Viktor; Kufleitner, Manfred Forbidden patterns for \(\mathrm{FO}^2\) alternation over finite and infinite words. (English) Zbl 07727034 Int. J. Found. Comput. Sci. 34, No. 2-3, 183-224 (2023). MSC: 68Q45 03C13 68Q19 PDFBibTeX XMLCite \textit{V. Henriksson} and \textit{M. Kufleitner}, Int. J. Found. Comput. Sci. 34, No. 2--3, 183--224 (2023; Zbl 07727034) Full Text: DOI arXiv
Frei, Fabian; Hromkovič, Juraj; Královič, Rastislav; Královič, Richard Two-way non-uniform finite automata. (English) Zbl 07727032 Int. J. Found. Comput. Sci. 34, No. 2-3, 145-162 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Frei} et al., Int. J. Found. Comput. Sci. 34, No. 2--3, 145--162 (2023; Zbl 07727032) Full Text: DOI
Cambie, Stijn; de Bondt, Michiel; Don, Henk Extremal binary PFAs with small number of states. (English) Zbl 07727030 Int. J. Found. Comput. Sci. 34, No. 2-3, 85-115 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. Cambie} et al., Int. J. Found. Comput. Sci. 34, No. 2--3, 85--115 (2023; Zbl 07727030) Full Text: DOI arXiv
Midya, Abhisek; Thomas, D. G. A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages. (English) Zbl 1528.68190 Barneva, Reneta P. (ed.) et al., Combinatorial image analysis. 21st international workshop, IWCIA 2022, Messina, Italy, July 13–15, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13348, 154-170 (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. Midya} and \textit{D. G. Thomas}, Lect. Notes Comput. Sci. 13348, 154--170 (2023; Zbl 1528.68190) Full Text: DOI
Maraj, Aida; Nagel, Uwe Shift invariant algebras, Segre products and regular languages. (English) Zbl 1522.13042 J. Algebra 631, 236-266 (2023). Reviewer: Alessandro Gimigliano (Bologna) MSC: 13P25 13D40 13A02 PDFBibTeX XMLCite \textit{A. Maraj} and \textit{U. Nagel}, J. Algebra 631, 236--266 (2023; Zbl 1522.13042) Full Text: DOI arXiv
Duncan, Andrew; Evetts, Alex; Holt, Derek F.; Rees, Sarah Using edt0l systems to solve some equations in the solvable Baumslag-Solitar groups. (English) Zbl 07701671 J. Algebra 630, 434-456 (2023). MSC: 68Qxx 20Fxx 20Mxx PDFBibTeX XMLCite \textit{A. Duncan} et al., J. Algebra 630, 434--456 (2023; Zbl 07701671) Full Text: DOI arXiv
Kutrib, Martin; Wendlandt, Matthias State complexity of finite partial languages. (English) Zbl 07699969 Theor. Comput. Sci. 966-967, Article ID 114001, 11 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Kutrib} and \textit{M. Wendlandt}, Theor. Comput. Sci. 966--967, Article ID 114001, 11 p. (2023; Zbl 07699969) Full Text: DOI
Currie, James; Ochem, Pascal; Rampersad, Narad; Shallit, Jeffrey Properties of a ternary infinite word. (English) Zbl 1527.11021 RAIRO, Theor. Inform. Appl. 57, Paper No. 1, 17 p. (2023). Reviewer: Jean-Paul Allouche (Paris) MSC: 11B85 68R15 03D05 68Q45 PDFBibTeX XMLCite \textit{J. Currie} et al., RAIRO, Theor. Inform. Appl. 57, Paper No. 1, 17 p. (2023; Zbl 1527.11021) Full Text: DOI arXiv
Nozdrunov, Vladislav I. Decomposition of polynomials using the shift-composition operation. (English. Russian original) Zbl 1524.68204 Discrete Math. Appl. 33, No. 2, 87-97 (2023); translation from Diskretn. Mat. 33, No. 4, 68-82 (2021). MSC: 68Q70 94A55 PDFBibTeX XMLCite \textit{V. I. Nozdrunov}, Discrete Math. Appl. 33, No. 2, 87--97 (2023; Zbl 1524.68204); translation from Diskretn. Mat. 33, No. 4, 68--82 (2021) Full Text: DOI
Babakov, R. M.; Barkalov, A. A. A matrix method for detecting formal solutions to the problem of algebraic synthesis of a finite-state machine with a datapath of transitions. (English. Ukrainian original) Zbl 1510.68006 Cybern. Syst. Anal. 59, No. 2, 190-198 (2023); translation from Kibern. Sist. Anal. 59, No. 2, 18-26 (2023). MSC: 68M07 68Q45 PDFBibTeX XMLCite \textit{R. M. Babakov} and \textit{A. A. Barkalov}, Cybern. Syst. Anal. 59, No. 2, 190--198 (2023; Zbl 1510.68006); translation from Kibern. Sist. Anal. 59, No. 2, 18--26 (2023) Full Text: DOI
Bell, Jason; Liu, Haggai; Mishna, Marni Cogrowth series for free products of finite groups. (English) Zbl 1517.20038 Int. J. Algebra Comput. 33, No. 2, 237-260 (2023). Reviewer: Daniel Juan Pineda (Michoacán) MSC: 20E06 05C25 05A15 PDFBibTeX XMLCite \textit{J. Bell} et al., Int. J. Algebra Comput. 33, No. 2, 237--260 (2023; Zbl 1517.20038) Full Text: DOI arXiv
Mrykhin, Mikhail; Okhotin, Alexander The hardest language for grammars with context operators. (English) Zbl 07681292 Theor. Comput. Sci. 958, Article ID 113829, 19 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Mrykhin} and \textit{A. Okhotin}, Theor. Comput. Sci. 958, Article ID 113829, 19 p. (2023; Zbl 07681292) Full Text: DOI arXiv
Huang, Liang-Yi; Wen, Zhi-Ying; Yang, Ya-Min; Zhu, Yun-Jie Topology automaton of self-similar sets and its applications to metrical classifications. (English) Zbl 07672510 Nonlinearity 36, No. 5, 2541-2566 (2023). MSC: 28A80 26A16 68Q45 PDFBibTeX XMLCite \textit{L.-Y. Huang} et al., Nonlinearity 36, No. 5, 2541--2566 (2023; Zbl 07672510) Full Text: DOI
Šestáková, Eliška; Guth, Ondřej; Janoušek, Jan Inexact tree pattern matching with 1-degree edit distance using finite automata. (English) Zbl 1506.68085 Discrete Appl. Math. 330, 78-97 (2023). MSC: 68R10 68Q25 68Q45 PDFBibTeX XMLCite \textit{E. Šestáková} et al., Discrete Appl. Math. 330, 78--97 (2023; Zbl 1506.68085) Full Text: DOI
Peyrière, Jacques Moore machines duality. (English) Zbl 07661892 Theor. Comput. Sci. 951, Article ID 113774, 5 p. (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Peyrière}, Theor. Comput. Sci. 951, Article ID 113774, 5 p. (2023; Zbl 07661892) Full Text: DOI arXiv
Martynova, Olga; Okhotin, Alexander State complexity of transforming graph-walking automata to halting, returning and reversible. (English) Zbl 1506.68048 Inf. Comput. 291, Article ID 105011, 24 p. (2023). MSC: 68Q45 PDFBibTeX XMLCite \textit{O. Martynova} and \textit{A. Okhotin}, Inf. Comput. 291, Article ID 105011, 24 p. (2023; Zbl 1506.68048) Full Text: DOI
Kuske, Dietrich; Schwarz, Christian Alternating complexity of counting first-order logic for the subword order. (English) Zbl 1507.68125 Acta Inf. 60, No. 1, 79-100 (2023). MSC: 68Q19 03B70 68Q45 PDFBibTeX XMLCite \textit{D. Kuske} and \textit{C. Schwarz}, Acta Inf. 60, No. 1, 79--100 (2023; Zbl 1507.68125) 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
Chavan, Pallavi Vijay; Jadhav, Ashish Automata theory and formal languages. (English) Zbl 07639970 Amsterdam: Elsevier/Academic Press (ISBN 978-0-323-91784-1/pbk; 978-0-323-97217-8/ebook). xxii, 209 p. (2023). Reviewer: Andreas Maletti (Leipzig) MSC: 68-01 68Q04 68Q45 PDFBibTeX XMLCite \textit{P. V. Chavan} and \textit{A. Jadhav}, Automata theory and formal languages. Amsterdam: Elsevier/Academic Press (2023; Zbl 07639970)
Zhong, Bingzhuo; Lavaei, Abolfazl; Zamani, Majid; Caccamo, Marco Automata-based controller synthesis for stochastic systems: a game framework via approximate probabilistic relations. (English) Zbl 1505.93257 Automatica 147, Article ID 110696, 16 p. (2023). MSC: 93E03 93C55 93B50 68Q45 91A15 PDFBibTeX XMLCite \textit{B. Zhong} et al., Automatica 147, Article ID 110696, 16 p. (2023; Zbl 1505.93257) Full Text: DOI arXiv
Chakraborty, Sankardeep; Grossi, Roberto; Sadakane, Kunihiko; Satti, Srinivasa Rao Succinct representation for (non)deterministic finite automata. (English) Zbl 1497.68254 J. Comput. Syst. Sci. 131, 1-12 (2023). MSC: 68Q45 68P05 68Q25 PDFBibTeX XMLCite \textit{S. Chakraborty} et al., J. Comput. Syst. Sci. 131, 1--12 (2023; Zbl 1497.68254) Full Text: DOI
Gustafson, Paul; Im, Mee Seong; Khovanov, Mikhail Boolean TQFTs with accumulating defects, sofic systems, and automata for infinite words. arXiv:2312.17033 Preprint, arXiv:2312.17033 [math.CT] (2023). MSC: 57K16 68Q45 18M05 37B10 06A12 68Q70 18B20 BibTeX Cite \textit{P. Gustafson} et al., ``Boolean TQFTs with accumulating defects, sofic systems, and automata for infinite words'', Preprint, arXiv:2312.17033 [math.CT] (2023) Full Text: arXiv OA License
Petrov, Semyon; Petrov, Fedor; Okhotin, Alexander On the rank of the communication matrix for deterministic two-way finite automata. arXiv:2312.05909 Preprint, arXiv:2312.05909 [cs.FL] (2023). MSC: 68Q45 20C30 BibTeX Cite \textit{S. Petrov} et al., ``On the rank of the communication matrix for deterministic two-way finite automata'', Preprint, arXiv:2312.05909 [cs.FL] (2023) Full Text: arXiv OA License
Lohrey, Markus; Rosowski, Andreas Parameterized Complexity of Factorization Problems. arXiv:2311.16562 Preprint, arXiv:2311.16562 [math.GR] (2023). MSC: 20B05 20F10 68Q45 BibTeX Cite \textit{M. Lohrey} and \textit{A. Rosowski}, ``Parameterized Complexity of Factorization Problems'', Preprint, arXiv:2311.16562 [math.GR] (2023) Full Text: arXiv OA License
Im, Mee Seong; Khovanov, Mikhail From finite state automata to tangle cobordisms: a TQFT journey from one to four dimensions. arXiv:2309.00708 Preprint, arXiv:2309.00708 [math.QA] (2023). MSC: 57K16 57K18 57K45 68Q45 18M30 68Q70 18B20 BibTeX Cite \textit{M. S. Im} and \textit{M. Khovanov}, ``From finite state automata to tangle cobordisms: a TQFT journey from one to four dimensions'', Preprint, arXiv:2309.00708 [math.QA] (2023) Full Text: arXiv OA License
Zhong, Bingzhuo; Lavaei, Abolfazl; Zamani, Majid; Caccamo, Marco Poster abstract: Controller synthesis for nonlinear stochastic games via approximate probabilistic relations. (English) Zbl 07807733 Proceedings of the 25th ACM international conference on hybrid systems: computation and control, HSCC 2022, part of CPS-IoT week, Milan, Italy and virtual, May 4–6, 2022. New York, NY: Association for Computing Machinery (ACM). Paper No. 25, 2 p. (2022). MSC: 68Q45 68Q60 93C30 PDFBibTeX XMLCite \textit{B. Zhong} et al., in: Proceedings of the 25th ACM international conference on hybrid systems: computation and control, HSCC 2022, part of CPS-IoT week, Milan, Italy and virtual, May 4--6, 2022. New York, NY: Association for Computing Machinery (ACM). Paper No. 25, 2 p. (2022; Zbl 07807733) Full Text: DOI
Fazekas, Szilárd Zsolt; Hoshi, Kaito; Yamamura, Akihiro The effect of jumping modes on various automata models. (English) Zbl 07805977 Nat. Comput. 21, No. 1, 17-30 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. Z. Fazekas} et al., Nat. Comput. 21, No. 1, 17--30 (2022; Zbl 07805977) Full Text: DOI
Kaspar, A. John; Sheena Christy, D. K.; Masilamani, V.; Thomas, D. G. Two dimensional fuzzy regular languages. (English) Zbl 1522.68274 Fuzzy Sets Syst. 442, 309-330 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. J. Kaspar} et al., Fuzzy Sets Syst. 442, 309--330 (2022; Zbl 1522.68274) Full Text: DOI
Volkov, Mikhail V. Synchronization of finite automata. (English. Russian original) Zbl 07733482 Russ. Math. Surv. 77, No. 5, 819-891 (2022); translation from Usp. Mat. Nauk 77, No. 5, 53-130 (2022). MSC: 03D15 20F10 20M35 68Q25 68Q45 68Q70 68R15 PDFBibTeX XMLCite \textit{M. V. Volkov}, Russ. Math. Surv. 77, No. 5, 819--891 (2022; Zbl 07733482); translation from Usp. Mat. Nauk 77, No. 5, 53--130 (2022) Full Text: DOI MNR
Nagy, Benedek; Parchami, Shaghayegh \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter. (English) Zbl 07732614 Nat. Comput. 21, No. 4, 679-691 (2022). MSC: 68Q45 68Q07 PDFBibTeX XMLCite \textit{B. Nagy} and \textit{S. Parchami}, Nat. Comput. 21, No. 4, 679--691 (2022; Zbl 07732614) Full Text: DOI
Rovan, Branislav; Varga, András Finite approximations and similarity of languages. (English) Zbl 1517.68215 Int. J. Found. Comput. Sci. 33, No. 8, 967-1003 (2022). MSC: 68Q45 68Q42 PDFBibTeX XMLCite \textit{B. Rovan} and \textit{A. Varga}, Int. J. Found. Comput. Sci. 33, No. 8, 967--1003 (2022; Zbl 1517.68215) Full Text: DOI
Moerman, Joshua; Wißmann, Thorsten State identification and verification with satisfaction. (English) Zbl 1524.68176 Jansen, Nils (ed.) et al., A journey from process algebra via timed automata to model learning. Essays dedicated to Frits Vaandrager on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 13560, 450-466 (2022). MSC: 68Q45 68Q60 68R07 PDFBibTeX XMLCite \textit{J. Moerman} and \textit{T. Wißmann}, Lect. Notes Comput. Sci. 13560, 450--466 (2022; Zbl 1524.68176) Full Text: DOI
Cleaveland, Rance Better automata through process algebra. (English) Zbl 1524.68168 Jansen, Nils (ed.) et al., A journey from process algebra via timed automata to model learning. Essays dedicated to Frits Vaandrager on the occasion of his 60th birthday. Cham: Springer. Lect. Notes Comput. Sci. 13560, 116-136 (2022). MSC: 68Q45 68Q55 68Q85 PDFBibTeX XMLCite \textit{R. Cleaveland}, Lect. Notes Comput. Sci. 13560, 116--136 (2022; Zbl 1524.68168) Full Text: DOI arXiv
Grigorchuk, R.; Kogan, R.; Vorobets, Y. Automatic logarithm and associated measures. (English) Zbl 1523.68038 Algebra Discrete Math. 34, No. 1, 22-67 (2022). Reviewer: Enrico Jabara (Venezia) MSC: 68Q45 20E08 37B10 60B05 PDFBibTeX XMLCite \textit{R. Grigorchuk} et al., Algebra Discrete Math. 34, No. 1, 22--67 (2022; Zbl 1523.68038) Full Text: arXiv Link
Khashaev, Arthur A. On the membership problem for finite automata over symmetric groups. (English. Russian original) Zbl 1506.68047 Discrete Math. Appl. 32, No. 6, 383-389 (2022); translation from Diskretn. Mat. 33, No. 1, 82-90 (2021). MSC: 68Q45 20B30 68Q17 PDFBibTeX XMLCite \textit{A. A. Khashaev}, Discrete Math. Appl. 32, No. 6, 383--389 (2022; Zbl 1506.68047); translation from Diskretn. Mat. 33, No. 1, 82--90 (2021) Full Text: DOI
Kutrib, Martin; Wendlandt, Matthias State complexity of finite partial languages. (English) Zbl 07643471 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, 170-183 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Kutrib} and \textit{M. Wendlandt}, Lect. Notes Comput. Sci. 13439, 170--183 (2022; Zbl 07643471) Full Text: DOI
Caragiu, Mihai; Harbaugh, Rachael Extending a Putnam problem to fields of various characteristics. (English) Zbl 1513.11087 JP J. Algebra Number Theory Appl. 59, 33-45 (2022). MSC: 11B75 03C07 97U40 PDFBibTeX XMLCite \textit{M. Caragiu} and \textit{R. Harbaugh}, JP J. Algebra Number Theory Appl. 59, 33--45 (2022; Zbl 1513.11087) Full Text: DOI
Berndt, Sebastian; Liśkiewicz, Maciej; Lutter, Matthias; Reischuk, Rüdiger Learning residual alternating automata. (English) Zbl 07629159 Inf. Comput. 289, Part A, Article ID 104981, 22 p. (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. Berndt} et al., Inf. Comput. 289, Part A, Article ID 104981, 22 p. (2022; Zbl 07629159) 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
Fernau, Henning; Bruchertseifer, Jens Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (English) Zbl 07618926 Math. Struct. Comput. Sci. 32, No. 2, 189-215 (2022). MSC: 68Q27 68Q45 PDFBibTeX XMLCite \textit{H. Fernau} and \textit{J. Bruchertseifer}, Math. Struct. Comput. Sci. 32, No. 2, 189--215 (2022; Zbl 07618926) Full Text: DOI
Phalakarn, Kittiphop; Attrapadung, Nuttapong; Matsuura, Kanta Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA. (English) Zbl 1509.68082 Ateniese, Giuseppe (ed.) et al., Applied cryptography and network security. 20th international conference, ACNS 2022, Rome, Italy, June 20–23, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13269, 605-625 (2022). MSC: 68Q10 68Q45 94A60 PDFBibTeX XMLCite \textit{K. Phalakarn} et al., Lect. Notes Comput. Sci. 13269, 605--625 (2022; Zbl 1509.68082) Full Text: DOI
Gezer, M. Utkan; Say, A. C. Cem Constant-space, constant-randomness verifiers with arbitrarily small error. (English) Zbl 07601276 Inf. Comput. 288, Article ID 104744, 13 p. (2022). MSC: 68Q45 68Q10 PDFBibTeX XMLCite \textit{M. U. Gezer} and \textit{A. C. C. Say}, Inf. Comput. 288, Article ID 104744, 13 p. (2022; Zbl 07601276) Full Text: DOI arXiv
Geffert, Viliam; Kapoutsis, Christos A.; Zakzok, Mohammad Improved complement for two-way alternating automata. (English) Zbl 07592345 Acta Inf. 59, No. 5, 619-669 (2022). MSC: 68Q05 68Q10 68Q19 68Q45 PDFBibTeX XMLCite \textit{V. Geffert} et al., Acta Inf. 59, No. 5, 619--669 (2022; Zbl 07592345) Full Text: DOI
Mráz, František; Otto, Friedrich Recognizing picture languages by reductions to string languages. (English) Zbl 07584603 J. Autom. Lang. Comb. 27, No. 1-3, 199-228 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{F. Mráz} and \textit{F. Otto}, J. Autom. Lang. Comb. 27, No. 1--3, 199--228 (2022; Zbl 07584603) Full Text: Link
Lyon, Oliver A. S.; Salomaa, Kai Nondeterministic state complexity of site-directed insertion. (English) Zbl 07584602 J. Autom. Lang. Comb. 27, No. 1-3, 187-197 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{O. A. S. Lyon} and \textit{K. Salomaa}, J. Autom. Lang. Comb. 27, No. 1--3, 187--197 (2022; Zbl 07584602) Full Text: Link
Koss, Tore Reverting and combining soliton bursts. (English) Zbl 07584601 J. Autom. Lang. Comb. 27, No. 1-3, 179-186 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{T. Koss}, J. Autom. Lang. Comb. 27, No. 1--3, 179--186 (2022; Zbl 07584601) Full Text: Link
Fazekas, Szilárd Zsolt; Mercaș, Robert; Wu, Olivia Complexities for jumps and sweeps. (English) Zbl 07584599 J. Autom. Lang. Comb. 27, No. 1-3, 131-149 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. Z. Fazekas} et al., J. Autom. Lang. Comb. 27, No. 1--3, 131--149 (2022; Zbl 07584599) Full Text: Link
Bordihn, Henning; Jürgensen, Helmut Multi-wave soliton automata. (English) Zbl 07584598 J. Autom. Lang. Comb. 27, No. 1-3, 91-130 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{H. Bordihn} and \textit{H. Jürgensen}, J. Autom. Lang. Comb. 27, No. 1--3, 91--130 (2022; Zbl 07584598) Full Text: Link
Battyányi, Péter; Mihálydeák, Tamás; Vaszil, György Rough-set-like approximation spaces for formal languages. (English) Zbl 07584597 J. Autom. Lang. Comb. 27, No. 1-3, 79-90 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Battyányi} et al., J. Autom. Lang. Comb. 27, No. 1--3, 79--90 (2022; Zbl 07584597) Full Text: Link
Rumenova, Yana; Tinchev, Tinko Modal definability: two commuting equivalence relations. (English) Zbl 07580915 Log. Univers. 16, No. 1-2, 177-194 (2022). MSC: 03-02 03C07 03C13 03B25 03B45 PDFBibTeX XMLCite \textit{Y. Rumenova} and \textit{T. Tinchev}, Log. Univers. 16, No. 1--2, 177--194 (2022; Zbl 07580915) Full Text: DOI
Muškardin, Edi; Aichernig, Bernhard K.; Pill, Ingo; Tappler, Martin Learning finite state models from recurrent neural networks. (English) Zbl 1502.68263 ter Beek, Maurice H. (ed.) et al., Integrated formal methods. 17th international conference, IFM 2022, Lugano, Switzerland, June 7–10, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13274, 229-248 (2022). MSC: 68T05 68Q32 68Q45 PDFBibTeX XMLCite \textit{E. Muškardin} et al., Lect. Notes Comput. Sci. 13274, 229--248 (2022; Zbl 1502.68263) Full Text: DOI
Dolu, Özdeniz; Ersoy, Nevzat; Gezer, M. Utkan; Say, A. C. Cem Real-time, constant-space, constant-randomness verifiers. (English) Zbl 07572324 Caron, Pascal (ed.) et al., Implementation and application of automata. 26th international conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13266, 212-224 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{Ö. Dolu} et al., Lect. Notes Comput. Sci. 13266, 212--224 (2022; Zbl 07572324) Full Text: DOI arXiv
Yılmaz, Öykü; Kıyak, Fırat; Üngör, Meriç; Say, A. C. Cem Energy complexity of regular language recognition. (English) Zbl 07572323 Caron, Pascal (ed.) et al., Implementation and application of automata. 26th international conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13266, 200-211 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{Ö. Yılmaz} et al., Lect. Notes Comput. Sci. 13266, 200--211 (2022; Zbl 07572323) Full Text: DOI arXiv
Lyon, Oliver A. S.; Salomaa, Kai Nondeterministic state complexity of site-directed deletion. (English) Zbl 07572322 Caron, Pascal (ed.) et al., Implementation and application of automata. 26th international conference, CIAA 2022, Rouen, France, June 28 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13266, 189-199 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{O. A. S. Lyon} and \textit{K. Salomaa}, Lect. Notes Comput. Sci. 13266, 189--199 (2022; Zbl 07572322) Full Text: DOI
Klíma, Ondřej; Kolegar, Jonatan Well quasi-orders arising from finite ordered semigroups. (English) Zbl 07571010 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, 201-212 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{O. Klíma} and \textit{J. Kolegar}, Lect. Notes Comput. Sci. 13257, 201--212 (2022; Zbl 07571010) Full Text: DOI arXiv
Hoffmann, Stefan Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages. (English) Zbl 07571007 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, 164-176 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. Hoffmann}, Lect. Notes Comput. Sci. 13257, 164--176 (2022; Zbl 07571007) Full Text: DOI
Kjos-Hanssen, Bjørn; Liu, Lei The number of languages with maximum state complexity. (English) Zbl 07565556 Algebra Univers. 83, No. 3, Paper No. 33, 18 p. (2022). MSC: 68Q45 05A15 68Q19 PDFBibTeX XMLCite \textit{B. Kjos-Hanssen} and \textit{L. Liu}, Algebra Univers. 83, No. 3, Paper No. 33, 18 p. (2022; Zbl 07565556) Full Text: DOI
D’Angeli, D.; Francoeur, D.; Rodaro, E.; Wächter, J. Ph. On the orbits of automaton semigroups and groups. (English) Zbl 07564469 Algebra Discrete Math. 33, No. 1, 1-29 (2022). MSC: 20E99 20F10 20M30 20M35 68Q70 PDFBibTeX XMLCite \textit{D. D'Angeli} et al., Algebra Discrete Math. 33, No. 1, 1--29 (2022; Zbl 07564469) Full Text: arXiv Link
de Melo, Alexsander Andrade; de Oliveira Oliveira, Mateus Second-order finite automata. (English) Zbl 1510.68035 Theory Comput. Syst. 66, No. 4, 861-909 (2022). MSC: 68Q45 68P05 68Q27 PDFBibTeX XMLCite \textit{A. A. de Melo} and \textit{M. de Oliveira Oliveira}, Theory Comput. Syst. 66, No. 4, 861--909 (2022; Zbl 1510.68035) Full Text: DOI
Yamakami, Tomoyuki Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice. (English) Zbl 1487.68153 Inf. Comput. 286, Article ID 104783, 26 p. (2022). MSC: 68Q45 68Q12 81P68 PDFBibTeX XMLCite \textit{T. Yamakami}, Inf. Comput. 286, Article ID 104783, 26 p. (2022; Zbl 1487.68153) Full Text: DOI arXiv
Ipate, Florentin; Gheorghe, Marian A model learning based testing approach for spiking neural P systems. (English) Zbl 1497.68191 Theor. Comput. Sci. 924, 1-16 (2022). MSC: 68Q07 68Q32 68Q45 PDFBibTeX XMLCite \textit{F. Ipate} and \textit{M. Gheorghe}, Theor. Comput. Sci. 924, 1--16 (2022; Zbl 1497.68191) Full Text: DOI
Peltomäki, Jarkko; Salo, Ville Automatic winning shifts. (English) Zbl 1507.68170 Inf. Comput. 285, Part B, Article ID 104883, 21 p. (2022). Reviewer: Michel Rigo (Liège) MSC: 68Q45 11B85 37B51 68R15 91A46 PDFBibTeX XMLCite \textit{J. Peltomäki} and \textit{V. Salo}, Inf. Comput. 285, Part B, Article ID 104883, 21 p. (2022; Zbl 1507.68170) Full Text: DOI arXiv
Yen, Di-De; Yen, Hsu-Chun On the decidability of the valuedness problem for two-way finite transducers. (English) Zbl 1504.68120 Inf. Comput. 285, Part B, Article ID 104870, 27 p. (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{D.-D. Yen} and \textit{H.-C. Yen}, Inf. Comput. 285, Part B, Article ID 104870, 27 p. (2022; Zbl 1504.68120) Full Text: DOI
Oliynyk, A. S.; Prokhorchuk, V. A. Amalgamated free product in terms of automata constructions. (English) Zbl 1505.20024 Commun. Algebra 50, No. 2, 740-750 (2022). MSC: 20E06 20F10 20E26 20E08 68Q70 PDFBibTeX XMLCite \textit{A. S. Oliynyk} and \textit{V. A. Prokhorchuk}, Commun. Algebra 50, No. 2, 740--750 (2022; Zbl 1505.20024) Full Text: DOI
Byszewski, Jakub; Cornelissen, Gunther; Tijsma, Djurre Automata and finite order elements in the Nottingham group. (English) Zbl 1503.11063 J. Algebra 602, 484-554 (2022). Reviewer: Thomas B. Ward (Durham) MSC: 11B85 11G20 11S31 11Y16 20E45 20F10 68Q70 PDFBibTeX XMLCite \textit{J. Byszewski} et al., J. Algebra 602, 484--554 (2022; Zbl 1503.11063) Full Text: DOI arXiv
Bell, Paul C. Polynomially ambiguous probabilistic automata on restricted languages. (English) Zbl 1483.68156 J. Comput. Syst. Sci. 127, 53-65 (2022). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. C. Bell}, J. Comput. Syst. Sci. 127, 53--65 (2022; Zbl 1483.68156) Full Text: DOI arXiv Link
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
Kjos-Hanssen, Bjørn; Felix, Clyde James; Kim, Sun Young; Lamb, Ethan; Takahashi, Davin VC-dimensions of nondeterministic finite automata for words of equal length. (English) Zbl 07473195 Ann. Math. Artif. Intell. 90, No. 1, 93-105 (2022). MSC: 68Q45 68Q68 68T05 PDFBibTeX XMLCite \textit{B. Kjos-Hanssen} et al., Ann. Math. Artif. Intell. 90, No. 1, 93--105 (2022; Zbl 07473195) Full Text: DOI arXiv
Gehrke, Mai; Jakl, Tomáš; Reggio, Luca A duality theoretic view on limits of finite structures. (English) Zbl 07471705 Log. Methods Comput. Sci. 18, No. 1, Paper No. 16, 38 p. (2022). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{M. Gehrke} et al., Log. Methods Comput. Sci. 18, No. 1, Paper No. 16, 38 p. (2022; Zbl 07471705) Full Text: arXiv Link
Wolf, Petra From decidability to undecidability by considering regular sets of instances. (English) Zbl 1515.68169 Theor. Comput. Sci. 899, 25-38 (2022). MSC: 68Q45 68R01 PDFBibTeX XMLCite \textit{P. Wolf}, Theor. Comput. Sci. 899, 25--38 (2022; Zbl 1515.68169) Full Text: DOI arXiv
Lohrey, Markus; Rosowski, Andreas; Zetzsche, Georg Membership Problems in Finite Groups. arXiv:2206.11756 Preprint, arXiv:2206.11756 [math.GR] (2022). MSC: 20B05 20F10 68Q45 BibTeX Cite \textit{M. Lohrey} et al., ``Membership Problems in Finite Groups'', Preprint, arXiv:2206.11756 [math.GR] (2022) Full Text: arXiv OA License
Im, Mee Seong; Khovanov, Mikhail Topological theories and automata. arXiv:2202.13398 Preprint, arXiv:2202.13398 [math.QA] (2022). MSC: 57K16 68Q45 18M10 18M30 06A12 68Q70 18B20 BibTeX Cite \textit{M. S. Im} and \textit{M. Khovanov}, ``Topological theories and automata'', Preprint, arXiv:2202.13398 [math.QA] (2022) Full Text: arXiv OA License
Bedon, Nicolas Branching automata and pomset automata. (English) Zbl 07799615 Bojańczyk, Mikołaj (ed.) et al., 41st IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2021, virtual conference, December 15–17, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 213, Article 37, 13 p. (2021). MSC: 68N30 68Qxx PDFBibTeX XMLCite \textit{N. Bedon}, LIPIcs -- Leibniz Int. Proc. Inform. 213, Article 37, 13 p. (2021; Zbl 07799615) Full Text: DOI
Arenas, Marcelo; Croquevielle, Luis Alberto; Jayaram, Rajesh; Riveros, Cristian A polynomial-time approximation algorithm for counting words accepted by an NFA. (English) Zbl 07765139 Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 4 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Arenas} et al., in: Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC '21, virtual, Italy, June 21--25, 2021. New York, NY: Association for Computing Machinery (ACM). 4 (2021; Zbl 07765139) Full Text: DOI
Nagy, Benedek State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata. (English) Zbl 07735514 Nat. Comput. 20, No. 4, 725-737 (2021). MSC: 68Q45 68Q07 PDFBibTeX XMLCite \textit{B. Nagy}, Nat. Comput. 20, No. 4, 725--737 (2021; Zbl 07735514) Full Text: DOI
Jecker, Ismaël; Mazzocchi, Nicolas; Wolf, Petra Decomposing permutation automata. (English) Zbl 07730620 Haddad, Serge (ed.) et al., 32nd international conference on concurrency theory, CONCUR 2021, August 24–27, 2021, virtual conference. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 203, Article 18, 19 p. (2021). MSC: 68Q85 PDFBibTeX XMLCite \textit{I. Jecker} et al., LIPIcs -- Leibniz Int. Proc. Inform. 203, Article 18, 19 p. (2021; Zbl 07730620) Full Text: DOI arXiv
Ko, Sang-Ki; Han, Yo-Sub Left is better than right for reducing nondeterminism of NFAs. (English) Zbl 1522.68276 Int. J. Found. Comput. Sci. 32, No. 5, 531-550 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{S.-K. Ko} and \textit{Y.-S. Han}, Int. J. Found. Comput. Sci. 32, No. 5, 531--550 (2021; Zbl 1522.68276) Full Text: DOI
Ibarra, Oscar H.; McQuillan, Ian Generalizations of checking stack automata: characterizations and hierarchies. (English) Zbl 1522.68272 Int. J. Found. Comput. Sci. 32, No. 5, 481-508 (2021). MSC: 68Q45 68Q04 PDFBibTeX XMLCite \textit{O. H. Ibarra} and \textit{I. McQuillan}, Int. J. Found. Comput. Sci. 32, No. 5, 481--508 (2021; Zbl 1522.68272) Full Text: DOI
Mika, Maksymilian; Szykuła, Marek The Frobenius and factor universality problems of the Kleene star of a finite set of words. (English) Zbl 1499.68190 J. ACM 68, No. 3, Paper No. 18, 22 p. (2021). MSC: 68Q45 68R15 PDFBibTeX XMLCite \textit{M. Mika} and \textit{M. Szykuła}, J. ACM 68, No. 3, Paper No. 18, 22 p. (2021; Zbl 1499.68190) Full Text: DOI arXiv
Wei, Lina; Huang, Guangjian; Wasti, Shahbaz Hassan; Hussain, Muhammad Jawad; Jiang, Yuncheng Generalized fuzzy automata with semantic computing. (English) Zbl 1498.68145 Soft Comput. 25, No. 7, 5775-5789 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{L. Wei} et al., Soft Comput. 25, No. 7, 5775--5789 (2021; Zbl 1498.68145) Full Text: DOI
Heidari, Dariush; Doostali, Saeed The application of hypergroups in symbolic executions and finite automata. (English) Zbl 1498.68177 Soft Comput. 25, No. 11, 7247-7256 (2021). MSC: 68Q70 20N20 PDFBibTeX XMLCite \textit{D. Heidari} and \textit{S. Doostali}, Soft Comput. 25, No. 11, 7247--7256 (2021; Zbl 1498.68177) Full Text: DOI