Lucero, Jorge C.; Staworko, Sławek A note on the class of languages generated by F-systems over regular languages. (English) Zbl 07609037 Inf. Process. Lett. 179, Article ID 106283, 4 p. (2023). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. C. Lucero} and \textit{S. Staworko}, Inf. Process. Lett. 179, Article ID 106283, 4 p. (2023; Zbl 07609037) Full Text: DOI arXiv OpenURL
Kószó, Dávid Tree generating context-free grammars and regular tree grammars are equivalent. (English) Zbl 07670599 Ann. Math. Inform. 56, 58-70 (2022). MSC: 68Q45 PDF BibTeX XML Cite \textit{D. Kószó}, Ann. Math. Inform. 56, 58--70 (2022; Zbl 07670599) Full Text: DOI OpenURL
Leiß, Hans An algebraic representation of the fixed-point closure of \(^*\)-continuous Kleene algebras – a categorical Chomsky-Schützenberger theorem. (English) Zbl 07650539 Math. Struct. Comput. Sci. 32, No. 6, 685-728 (2022). MSC: 68-XX PDF BibTeX XML Cite \textit{H. Leiß}, Math. Struct. Comput. Sci. 32, No. 6, 685--728 (2022; Zbl 07650539) Full Text: DOI OpenURL
Maarand, Hendrik; Tamm, Hellis Yet another canonical nondeterministic automaton. (English) Zbl 07643472 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, 184-196 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{H. Maarand} and \textit{H. Tamm}, Lect. Notes Comput. Sci. 13439, 184--196 (2022; Zbl 07643472) Full Text: DOI OpenURL
Antolín, Yago; Rivas, Cristóbal; Su, Hang Lu Regular left-orders on groups. (English) Zbl 07624159 J. Comb. Algebra 6, No. 3-4, 265-314 (2022). MSC: 20F60 06F15 68Q45 PDF BibTeX XML Cite \textit{Y. Antolín} et al., J. Comb. Algebra 6, No. 3--4, 265--314 (2022; Zbl 07624159) Full Text: DOI arXiv OpenURL
Defant, Colin Pop-stack-sorting for Coxeter groups. (English) Zbl 1498.05286 Combinatorial Theory 2, No. 3, Paper No. 11, 30 p. (2022). MSC: 05E16 37E15 05A05 20F55 PDF BibTeX XML Cite \textit{C. Defant}, Comb. Theory 2, No. 3, Paper No. 11, 30 p. (2022; Zbl 1498.05286) Full Text: DOI arXiv OpenURL
Almeida, Jorge; Costa, José Carlos; Zeitoun, Marc Recognizing pro-\(\mathrm{R}\) closures of regular languages. (English) Zbl 07583893 Forum Math. 34, No. 5, 1131-1145 (2022). MSC: 20M07 20M35 22A99 68Q70 PDF BibTeX XML Cite \textit{J. Almeida} et al., Forum Math. 34, No. 5, 1131--1145 (2022; Zbl 07583893) Full Text: DOI arXiv OpenURL
Fenner, Stephen; Padé, Daniel; Thierauf, Thomas The complexity of regex crosswords. (English) Zbl 1487.68126 Inf. Comput. 286, Article ID 104777, 18 p. (2022). MSC: 68Q25 68Q17 68Q45 PDF BibTeX XML Cite \textit{S. Fenner} et al., Inf. Comput. 286, Article ID 104777, 18 p. (2022; Zbl 1487.68126) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \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 OpenURL
Tamm, Hellis Quotients and atoms of reversible languages. (English) Zbl 07527763 Theor. Comput. Sci. 920, 33-45 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{H. Tamm}, Theor. Comput. Sci. 920, 33--45 (2022; Zbl 07527763) Full Text: DOI OpenURL
Carl, Merlin Space-bounded OTMs and \(\operatorname{REG}^\infty \). (English) Zbl 07481741 Computability 11, No. 1, 41-56 (2022). MSC: 03Dxx PDF BibTeX XML Cite \textit{M. Carl}, Computability 11, No. 1, 41--56 (2022; Zbl 07481741) Full Text: DOI arXiv OpenURL
Yang, Chao Intuitionistic fuzzy \(( \otimes,N)\)-general regular languages and their minimization implementation. (English) Zbl 07478972 Int. J. Approx. Reasoning 143, 216-231 (2022). MSC: 68T37 PDF BibTeX XML Cite \textit{C. Yang}, Int. J. Approx. Reasoning 143, 216--231 (2022; Zbl 07478972) Full Text: DOI OpenURL
Cseresnyes, Ehud; Seiwert, Hannes Regular expression length via arithmetic formula complexity. (English) Zbl 07466697 J. Comput. Syst. Sci. 125, 1-24 (2022). MSC: 68-XX PDF BibTeX XML Cite \textit{E. Cseresnyes} and \textit{H. Seiwert}, J. Comput. Syst. Sci. 125, 1--24 (2022; Zbl 07466697) Full Text: DOI arXiv OpenURL
Gnatenko, A. R.; Zakharov, V. A. On the satisfiability and model checking for one parameterized extension of linear-time temporal logic. (Russian. English summary) Zbl 07645066 Model. Anal. Inf. Sist. 28, No. 4, 356-371 (2021). MSC: 68W10 PDF BibTeX XML Cite \textit{A. R. Gnatenko} and \textit{V. A. Zakharov}, Model. Anal. Inf. Sist. 28, No. 4, 356--371 (2021; Zbl 07645066) Full Text: DOI MNR OpenURL
Ganty, Pierre; Ranzato, Francesco; Valero, Pedro Complete abstractions for checking language inclusion. (English) Zbl 1508.68190 ACM Trans. Comput. Log. 22, No. 4, Article No. 22, 40 p. (2021). MSC: 68Q45 PDF BibTeX XML Cite \textit{P. Ganty} et al., ACM Trans. Comput. Log. 22, No. 4, Article No. 22, 40 p. (2021; Zbl 1508.68190) Full Text: DOI arXiv OpenURL
Khadiev, Kamil; Kravchenko, Dmitry Quantum algorithm for Dyck language with multiple types of brackets. (English) Zbl 07553904 Kostitsyna, Irina et al., Unconventional computation and natural computation. 19th international conference, UCNC 2021, Espoo, Finland, October 18–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12984, 68-83 (2021). MSC: 68Q07 68Q09 68Q10 68Q12 PDF BibTeX XML Cite \textit{K. Khadiev} and \textit{D. Kravchenko}, Lect. Notes Comput. Sci. 12984, 68--83 (2021; Zbl 07553904) Full Text: DOI arXiv OpenURL
Barcucci, Elena; Bernini, Antonio; Pinzani, Renzo Strings from linear recurrences: a Gray code. (English) Zbl 07530207 Lecroq, Thierry (ed.) et al., Combinatorics on words. 13th international conference, WORDS 2021, Rouen, France, September 13–17, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12847, 40-49 (2021). MSC: 68R15 PDF BibTeX XML Cite \textit{E. Barcucci} et al., Lect. Notes Comput. Sci. 12847, 40--49 (2021; Zbl 07530207) Full Text: DOI OpenURL
Edixhoven, Luc; Jongmans, Sung-Shik Balanced-by-construction regular and \(\omega \)-regular languages. (English) Zbl 07498721 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, 130-142 (2021). MSC: 68Q45 PDF BibTeX XML Cite \textit{L. Edixhoven} and \textit{S.-S. Jongmans}, Lect. Notes Comput. Sci. 12811, 130--142 (2021; Zbl 07498721) Full Text: DOI OpenURL
Fleischer, Lukas; Shallit, Jeffrey Automata, palindromes, and reversed subwords. (English) Zbl 07488333 J. Autom. Lang. Comb. 26, No. 3-4, 221-253 (2021). MSC: 68Q45 PDF BibTeX XML Cite \textit{L. Fleischer} and \textit{J. Shallit}, J. Autom. Lang. Comb. 26, No. 3--4, 221--253 (2021; Zbl 07488333) Full Text: Link OpenURL
Tsarev, Aleksandr; Kukharev, Andrei Classes of monoids with applications: formations of languages and multiply local formations of finite groups. (English) Zbl 07424481 Rend. Circ. Mat. Palermo (2) 70, No. 3, 1257-1268 (2021). MSC: 20F17 20D10 PDF BibTeX XML Cite \textit{A. Tsarev} and \textit{A. Kukharev}, Rend. Circ. Mat. Palermo (2) 70, No. 3, 1257--1268 (2021; Zbl 07424481) Full Text: DOI OpenURL
Fernandes, Bernardo H.; Gomes, Gracinda M. S. \(\omega\sharp\)-algebras. (English) Zbl 1506.08007 Commun. Algebra 49, No. 9, 3969-3999 (2021). MSC: 08A70 08B20 20M07 20M35 68Q45 68Q70 PDF BibTeX XML Cite \textit{B. H. Fernandes} and \textit{G. M. S. Gomes}, Commun. Algebra 49, No. 9, 3969--3999 (2021; Zbl 1506.08007) Full Text: DOI OpenURL
Saarela, Aleksi Separating the words of a language by counting factors. (English) Zbl 1497.68279 Fundam. Inform. 180, No. 4, 375-393 (2021). MSC: 68Q45 68R15 PDF BibTeX XML Cite \textit{A. Saarela}, Fundam. Inform. 180, No. 4, 375--393 (2021; Zbl 1497.68279) Full Text: DOI OpenURL
Miyazaki, Takayuki; Minamide, Yasuhiko Context-free grammars with lookahead. (English) Zbl 07405989 Leporati, Alberto (ed.) et al., Language and automata theory and applications. 15th international conference, LATA 2021, Milan, Italy, March 1–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12638, 213-225 (2021). MSC: 68Q45 PDF BibTeX XML Cite \textit{T. Miyazaki} and \textit{Y. Minamide}, Lect. Notes Comput. Sci. 12638, 213--225 (2021; Zbl 07405989) Full Text: DOI OpenURL
Pighizzini, Giovanni; Rovan, Branislav; Sádovský, Šimon Usefulness of information and unary languages. (English) Zbl 07405983 Leporati, Alberto (ed.) et al., Language and automata theory and applications. 15th international conference, LATA 2021, Milan, Italy, March 1–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12638, 131-142 (2021). MSC: 68Q45 PDF BibTeX XML Cite \textit{G. Pighizzini} et al., Lect. Notes Comput. Sci. 12638, 131--142 (2021; Zbl 07405983) Full Text: DOI OpenURL
Maraj, Aida; Nagel, Uwe Equivariant Hilbert series for hierarchical models. (English) Zbl 1465.13025 Algebr. Stat. 12, No. 1, 21-42 (2021). Reviewer: Amir Hashemi (Isfahan) MSC: 13P25 68W30 PDF BibTeX XML Cite \textit{A. Maraj} and \textit{U. Nagel}, Algebr. Stat. 12, No. 1, 21--42 (2021; Zbl 1465.13025) Full Text: DOI arXiv OpenURL
Antolín, Yago; Paris, Luis Transverse properties of parabolic subgroups of Garside groups. (English) Zbl 1484.20062 Isr. J. Math. 241, No. 2, 501-526 (2021). Reviewer: Valeriy Bardakov (Novosibirsk) MSC: 20F36 20F05 20F10 20F69 PDF BibTeX XML Cite \textit{Y. Antolín} and \textit{L. Paris}, Isr. J. Math. 241, No. 2, 501--526 (2021; Zbl 1484.20062) Full Text: DOI arXiv OpenURL
Wang, Yanhui; Wang, Yuhan; Ren, Xueming; Shum, Kar Ping Quasi-automatic semigroups. (English) Zbl 1477.20126 Asian-Eur. J. Math. 14, No. 3, Article ID 2150046, 19 p. (2021). MSC: 20M35 20M05 PDF BibTeX XML Cite \textit{Y. Wang} et al., Asian-Eur. J. Math. 14, No. 3, Article ID 2150046, 19 p. (2021; Zbl 1477.20126) Full Text: DOI OpenURL
Gawrychowski, Paweł; Lange, Martin; Rampersad, Narad; Shallit, Jeffrey; Szykuła, Marek Existential length universality. (English) Zbl 07650901 Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 16, 14 p. (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{P. Gawrychowski} et al., LIPIcs -- Leibniz Int. Proc. Inform. 154, Article 16, 14 p. (2020; Zbl 07650901) Full Text: DOI arXiv OpenURL
Gnatenko, A. R.; Zakharov, V. A. On the model checking problem for some extension of \(\mathrm{CTL}^\ast\). (Russian. English summary) Zbl 07643312 Model. Anal. Inf. Sist. 27, No. 4, 428-441 (2020). MSC: 68Q60 03B44 68Q25 68Q45 PDF BibTeX XML Cite \textit{A. R. Gnatenko} and \textit{V. A. Zakharov}, Model. Anal. Inf. Sist. 27, No. 4, 428--441 (2020; Zbl 07643312) Full Text: DOI MNR OpenURL
Bleak, Collin On normalish subgroups of the R. Thompson groups. (English) Zbl 07601059 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, 29-42 (2020). MSC: 68Q45 PDF BibTeX XML Cite \textit{C. Bleak}, Lect. Notes Comput. Sci. 12086, 29--42 (2020; Zbl 07601059) Full Text: DOI OpenURL
Seiwert, Hannes Operational complexity of straight line programs for regular languages. (English) Zbl 07371299 Jirásková, Galina (ed.) et al., Descriptional complexity of formal systems. 22nd international conference, DCFS 2020, Vienna, Austria, August 24–26, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12442, 180-192 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{H. Seiwert}, Lect. Notes Comput. Sci. 12442, 180--192 (2020; Zbl 07371299) Full Text: DOI OpenURL
Průša, Daniel Complexity of two-dimensional rank-reducing grammars. (English) Zbl 07371297 Jirásková, Galina (ed.) et al., Descriptional complexity of formal systems. 22nd international conference, DCFS 2020, Vienna, Austria, August 24–26, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12442, 155-166 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. Průša}, Lect. Notes Comput. Sci. 12442, 155--166 (2020; Zbl 07371297) Full Text: DOI OpenURL
Cseresnyes, Ehud; Seiwert, Hannes Regular expression length via arithmetic formula complexity. (English) Zbl 07371287 Jirásková, Galina (ed.) et al., Descriptional complexity of formal systems. 22nd international conference, DCFS 2020, Vienna, Austria, August 24–26, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12442, 26-38 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{E. Cseresnyes} and \textit{H. Seiwert}, Lect. Notes Comput. Sci. 12442, 26--38 (2020; Zbl 07371287) Full Text: DOI arXiv OpenURL
Konstantinidis, Stavros Every regular bifix code is a finite union of regular infix codes. (English) Zbl 1462.68107 J. Autom. Lang. Comb. 25, No. 1, 55-59 (2020). MSC: 68Q45 94A45 PDF BibTeX XML Cite \textit{S. Konstantinidis}, J. Autom. Lang. Comb. 25, No. 1, 55--59 (2020; Zbl 1462.68107) Full Text: Link OpenURL
Flores, Ramón; González-Meneses, Juan On lexicographic representatives in braid monoids. (English) Zbl 07339571 J. Algebr. Comb. 52, No. 4, 561-597 (2020). MSC: 20M35 20M10 20M30 20F36 68Q70 PDF BibTeX XML Cite \textit{R. Flores} and \textit{J. González-Meneses}, J. Algebr. Comb. 52, No. 4, 561--597 (2020; Zbl 07339571) Full Text: DOI arXiv OpenURL
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 PDF BibTeX XML Cite \textit{J. A. Brzozowski} et al., Int. J. Found. Comput. Sci. 31, No. 8, 1113--1132 (2020; Zbl 1458.68091) Full Text: DOI OpenURL
Bell, Jason; Lidbetter, Thomas F.; Shallit, Jeffrey Additive number theory via approximation by regular languages. (English) Zbl 1467.11011 Int. J. Found. Comput. Sci. 31, No. 6, 667-687 (2020). Reviewer: Jean-Paul Allouche (Paris) MSC: 11B13 11A63 11B85 68R15 68Q45 PDF BibTeX XML Cite \textit{J. Bell} et al., Int. J. Found. Comput. Sci. 31, No. 6, 667--687 (2020; Zbl 1467.11011) Full Text: DOI OpenURL
Su, Hang Lu Formal language convexity in left-orderable groups. (English) Zbl 07261095 Int. J. Algebra Comput. 30, No. 7, 1437-1456 (2020). MSC: 20F65 06F15 PDF BibTeX XML Cite \textit{H. L. Su}, Int. J. Algebra Comput. 30, No. 7, 1437--1456 (2020; Zbl 07261095) Full Text: DOI arXiv OpenURL
Mohana, N.; Desikan, Kalyani Parallelisable string-based SP-local languages and their properties. (English) Zbl 1444.68098 Int. J. Math. Comput. Sci. 15, No. 4, 1321-1325 (2020). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{N. Mohana} and \textit{K. Desikan}, Int. J. Math. Comput. Sci. 15, No. 4, 1321--1325 (2020; Zbl 1444.68098) Full Text: Link OpenURL
Tsarev, Aleksandr Laws of the lattices of \(\sigma \)-local formations of finite groups. (English) Zbl 1481.20060 Mediterr. J. Math. 17, No. 3, Paper No. 75, 13 p. (2020). MSC: 20D10 20D15 20D20 20D30 20M35 68Q70 PDF BibTeX XML Cite \textit{A. Tsarev}, Mediterr. J. Math. 17, No. 3, Paper No. 75, 13 p. (2020; Zbl 1481.20060) Full Text: DOI OpenURL
Bersani, Marcello M.; Rossi, Matteo; San Pietro, Pierluigi On the initialization of clocks in timed formalisms. (English) Zbl 1433.03048 Theor. Comput. Sci. 813, 175-198 (2020). MSC: 03B44 03D05 68Q45 PDF BibTeX XML Cite \textit{M. M. Bersani} et al., Theor. Comput. Sci. 813, 175--198 (2020; Zbl 1433.03048) Full Text: DOI Link OpenURL
Kuhlmann, Marco; Maletti, Andreas; Schiffer, Lena Katharina The tree-generative capacity of combinatory categorial grammars. (English) Zbl 07650341 Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 44, 14 p. (2019). MSC: 68N30 68Qxx PDF BibTeX XML Cite \textit{M. Kuhlmann} et al., LIPIcs -- Leibniz Int. Proc. Inform. 150, Article 44, 14 p. (2019; Zbl 07650341) Full Text: DOI OpenURL
Maarand, Hendrik; Uustalu, Tarmo Reordering derivatives of trace closures of regular languages. (English) Zbl 07649948 Fokkink, Wan (ed.) et al., 30th international conference on concurrency theory, CONCUR 2019, Amsterdam, the Netherlands, August 27–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 140, Article 40, 16 p. (2019). MSC: 68Q85 PDF BibTeX XML Cite \textit{H. Maarand} and \textit{T. Uustalu}, LIPIcs -- Leibniz Int. Proc. Inform. 140, Article 40, 16 p. (2019; Zbl 07649948) Full Text: DOI OpenURL
Lhote, Nathan; Michielini, Vincent; Skrzypczak, Michał Uniformisation gives the full strength of regular languages. (English) Zbl 07561705 Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 61, 13 p. (2019). MSC: 68Qxx PDF BibTeX XML Cite \textit{N. Lhote} et al., LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 61, 13 p. (2019; Zbl 07561705) Full Text: DOI OpenURL
Arulprakasam, R.; Dare, V. R.; Gnanasekara, S. Deterministic fuzzy automaton on subclasses of fuzzy regular \(\omega\)-languages. (English) Zbl 1455.68082 Iran. J. Math. Sci. Inform. 14, No. 1, 1-11 (2019). MSC: 68Q45 PDF BibTeX XML Cite \textit{R. Arulprakasam} et al., Iran. J. Math. Sci. Inform. 14, No. 1, 1--11 (2019; Zbl 1455.68082) Full Text: Link OpenURL
Liu, Zuhua; Guo, Yuqi; Leng, Jing The applications of solid codes to r-R and r-D languages. (English) Zbl 1436.20117 Soft Comput. 23, No. 21, 10709-10716 (2019). MSC: 20M35 20M05 68Q45 PDF BibTeX XML Cite \textit{Z. Liu} et al., Soft Comput. 23, No. 21, 10709--10716 (2019; Zbl 1436.20117) Full Text: DOI OpenURL
Ogawa, Mizuhito; Selivanov, Victor On classes of regular languages related to monotone WQOs. (English) Zbl 1434.68280 Hospodár, Michal (ed.) et al., Descriptional complexity of formal systems. 21st IFIP WG 1.02 international conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11612, 235-247 (2019). MSC: 68Q45 03B25 06A06 PDF BibTeX XML Cite \textit{M. Ogawa} and \textit{V. Selivanov}, Lect. Notes Comput. Sci. 11612, 235--247 (2019; Zbl 1434.68280) Full Text: DOI OpenURL
Brzozowski, Janusz A.; Davies, Sylvie; Madan, Abhishek State complexity of single-word pattern matching in regular languages. (English) Zbl 1434.68238 Hospodár, Michal (ed.) et al., Descriptional complexity of formal systems. 21st IFIP WG 1.02 international conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11612, 86-97 (2019). MSC: 68Q45 PDF BibTeX XML Cite \textit{J. A. Brzozowski} et al., Lect. Notes Comput. Sci. 11612, 86--97 (2019; Zbl 1434.68238) Full Text: DOI OpenURL
Bonfante, Guillaume; Deloup, Florian L. Decidability of regular language genus computation. (English) Zbl 1434.68236 Math. Struct. Comput. Sci. 29, No. 9, 1428-1443 (2019). MSC: 68Q45 05C10 PDF BibTeX XML Cite \textit{G. Bonfante} and \textit{F. L. Deloup}, Math. Struct. Comput. Sci. 29, No. 9, 1428--1443 (2019; Zbl 1434.68236) Full Text: DOI arXiv OpenURL
Bozhko, Sergey; Khatbullina, Leyla; Grigorev, Semyon Bar-Hillel theorem mechanization in Coq. (English) Zbl 07176931 Iemhoff, Rosalie (ed.) et al., Logic, language, information, and computation. 26th international workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2–5, 2019. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 11541, 264-281 (2019). MSC: 03B70 PDF BibTeX XML Cite \textit{S. Bozhko} et al., Lect. Notes Comput. Sci. 11541, 264--281 (2019; Zbl 07176931) Full Text: DOI OpenURL
Liu, Zuhua; Guo, Yuqi The concatenation of thin languages and \(r\)-disjunctive languages – several studies on combinatorial semigroups. I. (English) Zbl 1449.20064 J. Shandong Univ., Nat. Sci. 54, No. 6, 2-7 (2019). MSC: 20M35 68Q70 PDF BibTeX XML Cite \textit{Z. Liu} and \textit{Y. Guo}, J. Shandong Univ., Nat. Sci. 54, No. 6, 2--7 (2019; Zbl 1449.20064) Full Text: DOI OpenURL
Parker, Austin J.; Yancey, Kelly B.; Yancey, Matthew P. Definitions and properties of entropy and distance for regular languages. (English) Zbl 1478.37019 Hawkins, Jane (ed.) et al., Dynamical systems and random processes, 16th Carolina dynamics symposium, Agnes Scott College, Decatur, Georgia, April 13–15, 2018. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 736, 139-169 (2019). MSC: 37B10 37B15 68Q45 37B40 PDF BibTeX XML Cite \textit{A. J. Parker} et al., Contemp. Math. 736, 139--169 (2019; Zbl 1478.37019) Full Text: DOI OpenURL
Tsarev, Aleksandr Formations of finite monoids and their applications: formations of languages and \(\tau \)-closed saturated formations of finite groups. (English) Zbl 07144089 Ann. Univ. Ferrara, Sez. VII, Sci. Mat. 65, No. 2, 369-374 (2019). MSC: 20M35 68Q70 20D10 PDF BibTeX XML Cite \textit{A. Tsarev}, Ann. Univ. Ferrara, Sez. VII, Sci. Mat. 65, No. 2, 369--374 (2019; Zbl 07144089) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \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 OpenURL
Dubernard, Jean-Philippe; Guaiana, Giovanna; Mignot, Ludovic Geometrical closure of binary \(V_{3/2}\) languages. (English) Zbl 1425.68194 Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. 13th international conference, LATA 2019, St. Petersburg, Russia, March 26–29, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11417, 302-314 (2019). MSC: 68Q45 PDF BibTeX XML Cite \textit{J.-P. Dubernard} et al., Lect. Notes Comput. Sci. 11417, 302--314 (2019; Zbl 1425.68194) Full Text: DOI OpenURL
Fenner, Stephen; Padé, Daniel Complexity of regex crosswords. (English) Zbl 1425.68196 Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. 13th international conference, LATA 2019, St. Petersburg, Russia, March 26–29, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11417, 215-230 (2019). MSC: 68Q45 68Q17 68R05 PDF BibTeX XML Cite \textit{S. Fenner} and \textit{D. Padé}, Lect. Notes Comput. Sci. 11417, 215--230 (2019; Zbl 1425.68196) Full Text: DOI OpenURL
Saarela, Aleksi Separating many words by counting occurrences of factors. (English) Zbl 1497.68278 Hofman, Piotrek (ed.) et al., Developments in language theory. 23rd international conference, DLT 2019, Warsaw, Poland, August 5–9, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11647, 251-264 (2019). MSC: 68Q45 68R15 PDF BibTeX XML Cite \textit{A. Saarela}, Lect. Notes Comput. Sci. 11647, 251--264 (2019; Zbl 1497.68278) Full Text: DOI arXiv OpenURL
Vidal, J. Climent; Llópez, E. Cosme Eilenberg theorems for many-sorted formations. (English) Zbl 07103355 Houston J. Math. 45, No. 2, 321-369 (2019). MSC: 08A68 08A70 68Q70 PDF BibTeX XML Cite \textit{J. C. Vidal} and \textit{E. C. Llópez}, Houston J. Math. 45, No. 2, 321--369 (2019; Zbl 07103355) Full Text: arXiv OpenURL
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 PDF BibTeX XML Cite \textit{M. Szykuła} and \textit{J. Wittnebel}, Theor. Comput. Sci. 787, 45--76 (2019; Zbl 1429.68136) Full Text: DOI OpenURL
Ferens, Robert; Szykuła, Marek Complexity of bifix-free regular languages. (English) Zbl 1429.68110 Theor. Comput. Sci. 787, 14-27 (2019). MSC: 68Q45 PDF BibTeX XML Cite \textit{R. Ferens} and \textit{M. Szykuła}, Theor. Comput. Sci. 787, 14--27 (2019; Zbl 1429.68110) Full Text: DOI arXiv OpenURL
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 PDF BibTeX XML Cite \textit{J. A. Brzozowski} and \textit{C. Sinnamon}, Theor. Comput. Sci. 787, 2--13 (2019; Zbl 1429.68101) Full Text: DOI Link OpenURL
Fleischer, Lukas; Kufleitner, Manfred The complexity of weakly recognizing morphisms. (English) Zbl 1483.68166 RAIRO, Theor. Inform. Appl. 53, No. 1-2, 1-17 (2019). MSC: 68Q45 20M35 68Q17 68Q25 PDF BibTeX XML Cite \textit{L. Fleischer} and \textit{M. Kufleitner}, RAIRO, Theor. Inform. Appl. 53, No. 1--2, 1--17 (2019; Zbl 1483.68166) Full Text: DOI OpenURL
Kunc, Michal; Meitner, Jan The generalized rank of trace languages. (English) Zbl 1415.68134 Int. J. Found. Comput. Sci. 30, No. 1, 135-169 (2019). MSC: 68Q45 68Q70 PDF BibTeX XML Cite \textit{M. Kunc} and \textit{J. Meitner}, Int. J. Found. Comput. Sci. 30, No. 1, 135--169 (2019; Zbl 1415.68134) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{J. A. Brzozowski} et al., Theor. Comput. Sci. 777, 121--131 (2019; Zbl 1425.68184) Full Text: DOI arXiv OpenURL
Almeida, Jorge; Klíma, Ondřej On the insertion of \(n\)-powers. (English) Zbl 1483.06017 Discrete Math. Theor. Comput. Sci. 21, No. 3, Paper No. 5, 18 p. (2019). MSC: 06F05 68Q70 PDF BibTeX XML Cite \textit{J. Almeida} and \textit{O. Klíma}, Discrete Math. Theor. Comput. Sci. 21, No. 3, Paper No. 5, 18 p. (2019; Zbl 1483.06017) Full Text: arXiv Link OpenURL
Finkel, Olivier; Carton, Olivier; Lecomte, Dominique Polishness of some topologies related to word or tree automata. (English) Zbl 1454.03061 Log. Methods Comput. Sci. 15, No. 2, Paper No. 9, 21 p. (2019). MSC: 03E15 03D05 68Q45 PDF BibTeX XML Cite \textit{O. Finkel} et al., Log. Methods Comput. Sci. 15, No. 2, Paper No. 9, 21 p. (2019; Zbl 1454.03061) Full Text: arXiv OpenURL
Fleischer, Lukas; Kufleitner, Manfred Testing Simon’s congruence. (English) Zbl 07378379 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 62, 13 p. (2018). MSC: 68Qxx PDF BibTeX XML Cite \textit{L. Fleischer} and \textit{M. Kufleitner}, LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 62, 13 p. (2018; Zbl 07378379) Full Text: DOI arXiv OpenURL
Amarilli, Antoine; Paperman, Charles Topological sorting with regular constraints. (English) Zbl 1499.68166 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 115, 14 p. (2018). MSC: 68Q45 68Q17 68R10 PDF BibTeX XML Cite \textit{A. Amarilli} and \textit{C. Paperman}, LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 115, 14 p. (2018; Zbl 1499.68166) Full Text: DOI arXiv OpenURL
Brzozowski, Janusz A.; Davies, Sylvie Most complex deterministic union-free regular languages. (English) Zbl 1435.68150 Konstantinidis, Stavros (ed.) et al., Descriptional complexity of formal systems. 20th IFIP WG 1.02 international conference, DCFS 2018, Halifax, NS, Canada, July 25–27, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10952, 37-48 (2018). MSC: 68Q45 20M35 PDF BibTeX XML Cite \textit{J. A. Brzozowski} and \textit{S. Davies}, Lect. Notes Comput. Sci. 10952, 37--48 (2018; Zbl 1435.68150) Full Text: DOI arXiv OpenURL
Kari, Lila; Konstantinidis, Stavros; Kopecki, Steffen; Yang, Meng Efficient algorithms for computing the inner edit distance of a regular language via transducers. (English) Zbl 1461.68102 Algorithms (Basel) 11, No. 11, Paper No. 165, 18 p. (2018). MSC: 68Q45 PDF BibTeX XML Cite \textit{L. Kari} et al., Algorithms (Basel) 11, No. 11, Paper No. 165, 18 p. (2018; Zbl 1461.68102) Full Text: DOI OpenURL
Lindorfer, Christian The language of self-avoiding walks. Connective constants of quasi-transitive graphs. (English) Zbl 1407.05002 BestMasters. Wiesbaden: Springer Spektrum (Master Thesis) (ISBN 978-3-658-24763-8/pbk; 978-3-658-24764-5/ebook). viii, 65 p. (2018). MSC: 05-02 05C63 68Q45 05C90 05C78 PDF BibTeX XML Cite \textit{C. Lindorfer}, The language of self-avoiding walks. Connective constants of quasi-transitive graphs. Wiesbaden: Springer Spektrum (Master Thesis) (2018; Zbl 1407.05002) Full Text: DOI OpenURL
Gudivada, Akhil; Rao, Dhana L. Languages and grammar. (English) Zbl 1403.68112 Gudivada, Venkat N. (ed.) et al., Computational analysis and understanding of natural languages: principles, methods and applications. Amsterdam: Elsevier/North Holland (ISBN 978-0-444-64042-0/hbk; 978-0-444-64043-7/ebook). Handbook of Statistics 38, 15-29 (2018). MSC: 68Q45 68Q42 91F20 PDF BibTeX XML Cite \textit{A. Gudivada} and \textit{D. L. Rao}, Handb. Stat. 38, 15--29 (2018; Zbl 1403.68112) Full Text: DOI OpenURL
Sinnamon, Corwin Complexity of proper suffix-convex regular languages. (English) Zbl 06974644 Câmpeanu, Cezar (ed.), Implementation and application of automata. 23rd international conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10977, 324-338 (2018). MSC: 68Q45 20M35 PDF BibTeX XML Cite \textit{C. Sinnamon}, Lect. Notes Comput. Sci. 10977, 324--338 (2018; Zbl 06974644) Full Text: DOI arXiv OpenURL
Brzozowski, Janusz A.; Kari, Lila; Li, Bai; Szykuła, Marek State complexity of overlap assembly. (English) Zbl 1458.68090 Câmpeanu, Cezar (ed.), Implementation and application of automata. 23rd international conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10977, 109-120 (2018). MSC: 68Q45 92D20 PDF BibTeX XML Cite \textit{J. A. Brzozowski} et al., Lect. Notes Comput. Sci. 10977, 109--120 (2018; Zbl 1458.68090) Full Text: DOI arXiv OpenURL
Cai, Kai; Zhang, Renyuan; Wonham, W. M. Characterizations and effective computation of supremal relatively observable sublanguages. (English) Zbl 1398.93213 Discrete Event Dyn. Syst. 28, No. 2, 269-287 (2018). MSC: 93C65 93B07 68Q45 93A13 PDF BibTeX XML Cite \textit{K. Cai} et al., Discrete Event Dyn. Syst. 28, No. 2, 269--287 (2018; Zbl 1398.93213) Full Text: DOI arXiv OpenURL
Maslennikova, Marina; Rodaro, Emanuele Trim strongly connected synchronizing automata and ideal languages. (English) Zbl 1400.68110 Fundam. Inform. 162, No. 2-3, 183-203 (2018). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Maslennikova} and \textit{E. Rodaro}, Fundam. Inform. 162, No. 2--3, 183--203 (2018; Zbl 1400.68110) Full Text: DOI OpenURL
Ferraguti, Andrea; Micheli, Giacomo; Schnyder, Reto Irreducible compositions of degree two polynomials over finite fields have regular structure. (English) Zbl 1442.11163 Q. J. Math. 69, No. 3, 1089-1099 (2018). Reviewer: Robert Fitzgerald (Carbondale) MSC: 11T06 68Q45 PDF BibTeX XML Cite \textit{A. Ferraguti} et al., Q. J. Math. 69, No. 3, 1089--1099 (2018; Zbl 1442.11163) Full Text: DOI arXiv OpenURL
Daviaud, Laure; Paperman, Charles Classes of languages generated by the Kleene star of a word. (English) Zbl 1408.68097 Inf. Comput. 262, Part 1, 90-109 (2018). Reviewer: Magnus Steinby (Turku) MSC: 68Q70 20M35 68Q45 PDF BibTeX XML Cite \textit{L. Daviaud} and \textit{C. Paperman}, Inf. Comput. 262, Part 1, 90--109 (2018; Zbl 1408.68097) Full Text: DOI Link OpenURL
Câmpeanu, Cezar What is a complex regular language? (English) Zbl 1398.68303 J. Autom. Lang. Comb. 23, No. 1-3, 111-126 (2018). Reviewer: Cristian S. Calude (Auckland) MSC: 68Q45 68Q30 PDF BibTeX XML Cite \textit{C. Câmpeanu}, J. Autom. Lang. Comb. 23, No. 1--3, 111--126 (2018; Zbl 1398.68303) Full Text: DOI OpenURL
Brzozowski, Janusz A. Towards a theory of complexity of regular languages. (English) Zbl 1398.68300 J. Autom. Lang. Comb. 23, No. 1-3, 67-101 (2018). Reviewer: Ioan Tomescu (Bucureşti) MSC: 68Q45 PDF BibTeX XML Cite \textit{J. A. Brzozowski}, J. Autom. Lang. Comb. 23, No. 1--3, 67--101 (2018; Zbl 1398.68300) Full Text: DOI arXiv OpenURL
Kitpratyakul, Pongsakorn; Pibaljommee, Bundit A generalized superposition of linear tree languages and products of linear tree languages. (English) Zbl 1400.68108 Asian-Eur. J. Math. 11, No. 4, Article ID 1850048, 21 p. (2018). MSC: 68Q45 08A70 20M35 68Q70 PDF BibTeX XML Cite \textit{P. Kitpratyakul} and \textit{B. Pibaljommee}, Asian-Eur. J. Math. 11, No. 4, Article ID 1850048, 21 p. (2018; Zbl 1400.68108) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{J. A. Brzozowski} et al., Theory Comput. Syst. 62, No. 5, 1175--1202 (2018; Zbl 1398.68301) Full Text: DOI arXiv OpenURL
Dolce, Francesco; Perrin, Dominique; Restivo, Antonio; Reutenauer, Christophe; Rindone, Giuseppina Birecurrent sets. (English) Zbl 1395.68166 Int. J. Algebra Comput. 28, No. 4, 613-652 (2018). Reviewer: Magnus Steinby (Turku) MSC: 68Q45 20M35 68Q70 PDF BibTeX XML Cite \textit{F. Dolce} et al., Int. J. Algebra Comput. 28, No. 4, 613--652 (2018; Zbl 1395.68166) Full Text: DOI arXiv OpenURL
Iyudu, Natalia; Shkarin, Stanislav Quadratic automaton algebras and intermediate growth. (English) Zbl 1426.17003 J. Comb. Algebra 2, No. 2, 147-167 (2018). MSC: 17A45 16P90 16S37 PDF BibTeX XML Cite \textit{N. Iyudu} and \textit{S. Shkarin}, J. Comb. Algebra 2, No. 2, 147--167 (2018; Zbl 1426.17003) Full Text: DOI arXiv OpenURL
Kufleitner, Manfred; Wächter, Jan Philipp The word problem for omega-terms over the Trotter-Weil hierarchy. (English) Zbl 1435.20065 Theory Comput. Syst. 62, No. 3, 682-738 (2018). MSC: 20M05 03B25 03D05 03D40 20M07 PDF BibTeX XML Cite \textit{M. Kufleitner} and \textit{J. P. Wächter}, Theory Comput. Syst. 62, No. 3, 682--738 (2018; Zbl 1435.20065) Full Text: DOI Link OpenURL
Carton, Olivier; Perrin, Dominique; Pin, Jean-Éric A survey on difference hierarchies of regular languages. (English) Zbl 1390.68447 Log. Methods Comput. Sci. 14, No. 1, Paper No. 24, 23 p. (2018). MSC: 68Q70 20M35 68Q45 PDF BibTeX XML Cite \textit{O. Carton} et al., Log. Methods Comput. Sci. 14, No. 1, Paper No. 24, 23 p. (2018; Zbl 1390.68447) Full Text: DOI arXiv OpenURL
Brzozowski, Janusz A.; Szykuła, Marek Syntactic complexity of suffix-free languages. (English) Zbl 1390.68380 Inf. Comput. 259, Part 2, 174-190 (2018). MSC: 68Q45 20M35 PDF BibTeX XML Cite \textit{J. A. Brzozowski} and \textit{M. Szykuła}, Inf. Comput. 259, Part 2, 174--190 (2018; Zbl 1390.68380) Full Text: DOI Link OpenURL
Fromentin, Jean The rotating normal form of braids is regular. (English) Zbl 1427.20046 J. Algebra 501, 545-570 (2018). MSC: 20F36 20M35 20F10 68Q45 PDF BibTeX XML Cite \textit{J. Fromentin}, J. Algebra 501, 545--570 (2018; Zbl 1427.20046) Full Text: DOI arXiv OpenURL
Lengál, Ondřej; Lin, Anthony W.; Majumdar, Rupak; Rümmer, Philipp Fair termination for parameterized probabilistic concurrent systems. (English) Zbl 1452.68127 Legay, Axel (ed.) et al., Tools and algorithms for the construction and analysis of systems. 23rd international conference, TACAS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 10205, 499-517 (2017). MSC: 68Q85 68Q60 68Q87 PDF BibTeX XML Cite \textit{O. Lengál} et al., Lect. Notes Comput. Sci. 10205, 499--517 (2017; Zbl 1452.68127) Full Text: DOI arXiv Link OpenURL
Esparza, Javier; Křetínský, Jan; Raskin, Jean-François; Sickert, Salomon From LTL and limit-deterministic Büchi automata to deterministic parity automata. (English) Zbl 1452.68105 Legay, Axel (ed.) et al., Tools and algorithms for the construction and analysis of systems. 23rd international conference, TACAS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 10205, 426-442 (2017). MSC: 68Q45 03B44 03D05 PDF BibTeX XML Cite \textit{J. Esparza} et al., Lect. Notes Comput. Sci. 10205, 426--442 (2017; Zbl 1452.68105) Full Text: DOI arXiv OpenURL
Carton, Olivier; Finkel, Olivier; Lecomte, Dominique Polishness of some topologies related to automata. (English) Zbl 1434.03100 Goranko, Valentin (ed.) et al., 26th EACSL annual conference on computer science logic, CSL 2017, Stockholm, Sweden, August 20–24, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 82, Article 22, 16 p. (2017). MSC: 03D05 03E15 03D10 68Q45 PDF BibTeX XML Cite \textit{O. Carton} et al., LIPIcs -- Leibniz Int. Proc. Inform. 82, Article 22, 16 p. (2017; Zbl 1434.03100) Full Text: DOI OpenURL
Ng, Timothy; Rappaport, David; Salomaa, Kai Descriptional complexity of error detection. (English) Zbl 1396.68068 Adamatzky, Andrew (ed.), Emergent computation. A Festschrift for Selim G. Akl. Cham: Springer (ISBN 978-3-319-46375-9/hbk; 978-3-319-46376-6/ebook). Emergence, Complexity and Computation 24, 101-119 (2017). MSC: 68Q45 PDF BibTeX XML Cite \textit{T. Ng} et al., Emerg. Complex. Comput. 24, 101--119 (2017; Zbl 1396.68068) Full Text: DOI OpenURL
Brzozowski, Janusz A.; Sinnamon, Corwin Unrestricted state complexity of binary operations on regular and ideal languages. (English) Zbl 1390.68379 J. Autom. Lang. Comb. 22, No. 1-3, 29-59 (2017). MSC: 68Q45 PDF BibTeX XML Cite \textit{J. A. Brzozowski} and \textit{C. Sinnamon}, J. Autom. Lang. Comb. 22, No. 1--3, 29--59 (2017; Zbl 1390.68379) Full Text: DOI arXiv OpenURL
Champarnaud, Jean-Marc; Mignot, Ludovic; Ouali-Sebti, Nadia; Ziadi, Djelloul Bottom-up quotients for tree languages. (English) Zbl 1393.68090 J. Autom. Lang. Comb. 22, No. 4, 243-269 (2017). Reviewer: Magnus Steinby (Turku) MSC: 68Q45 PDF BibTeX XML Cite \textit{J.-M. Champarnaud} et al., J. Autom. Lang. Comb. 22, No. 4, 243--269 (2017; Zbl 1393.68090) Full Text: DOI arXiv OpenURL
Li, Yongming Quantitative model checking of linear-time properties based on generalized possibility measures. (English) Zbl 1382.68143 Fuzzy Sets Syst. 320, 17-39 (2017). MSC: 68Q60 03B44 68T37 PDF BibTeX XML Cite \textit{Y. Li}, Fuzzy Sets Syst. 320, 17--39 (2017; Zbl 1382.68143) Full Text: DOI arXiv OpenURL
Fernau, Henning; Freund, Rudolf; Siromoney, Rani; Subramanian, K. G. Non-isometric contextual array grammars and the role of regular control and local selectors. (English) Zbl 1398.68273 Fundam. Inform. 155, No. 1-2, 209-232 (2017). Reviewer: Andreas Maletti (Leipzig) MSC: 68Q42 PDF BibTeX XML Cite \textit{H. Fernau} et al., Fundam. Inform. 155, No. 1--2, 209--232 (2017; Zbl 1398.68273) Full Text: DOI OpenURL
Drewes, Frank; Holzer, Markus; Jakobi, Sebastian; van der Merwe, Brink Tight bounds for cut-operations on deterministic finite automata. (English) Zbl 1393.68091 Fundam. Inform. 155, No. 1-2, 89-110 (2017). Reviewer: Ahmet A. Khusainov (Komsomolsk-om-Amur) MSC: 68Q45 PDF BibTeX XML Cite \textit{F. Drewes} et al., Fundam. Inform. 155, No. 1--2, 89--110 (2017; Zbl 1393.68091) Full Text: DOI OpenURL
Bojańczyk, Mikołaj It is undecidable if two regular tree languages can be separated by a deterministic tree-walking automaton. (English) Zbl 1390.68374 Fundam. Inform. 154, No. 1-4, 37-46 (2017). Reviewer: Magnus Steinby (Turku) MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Bojańczyk}, Fundam. Inform. 154, No. 1--4, 37--46 (2017; Zbl 1390.68374) Full Text: DOI arXiv OpenURL
Ruivo, Eurico L. P.; de Oliveira, Pedro P. B. Inferring the limit behavior of some elementary cellular automata. (English) Zbl 1377.37022 Int. J. Bifurcation Chaos Appl. Sci. Eng. 27, No. 8, Article ID 1730028, 16 p. (2017). MSC: 37B15 68Q80 37B25 37B50 PDF BibTeX XML Cite \textit{E. L. P. Ruivo} and \textit{P. P. B. de Oliveira}, Int. J. Bifurcation Chaos Appl. Sci. Eng. 27, No. 8, Article ID 1730028, 16 p. (2017; Zbl 1377.37022) Full Text: DOI OpenURL
Cho, Da-Jung; Han, Yo-Sub; Ng, Timothy; Salomaa, Kai Outfix-guided insertion. (English) Zbl 1382.68133 Theor. Comput. Sci. 701, 70-84 (2017). MSC: 68Q45 92D20 PDF BibTeX XML Cite \textit{D.-J. Cho} et al., Theor. Comput. Sci. 701, 70--84 (2017; Zbl 1382.68133) Full Text: DOI arXiv OpenURL