Henriksson, Viktor; Kufleitner, Manfred Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words. (English) Zbl 07498725 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, 180-191 (2021). MSC: 68Q45 PDF BibTeX XML Cite \textit{V. Henriksson} and \textit{M. Kufleitner}, Lect. Notes Comput. Sci. 12811, 180--191 (2021; Zbl 07498725) Full Text: DOI OpenURL
Brengos, Tomasz A coalgebraic take on regular and \(\omega\)-regular behaviours. (English) Zbl 07471684 Log. Methods Comput. Sci. 17, No. 4, Paper No. 24, 46 p. (2021). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{T. Brengos}, Log. Methods Comput. Sci. 17, No. 4, Paper No. 24, 46 p. (2021; Zbl 07471684) Full Text: arXiv Link OpenURL
Lawson, Mark V. The polycyclic inverse monoids and the Thompson groups revisited. (English) Zbl 1482.20034 Romeo, P. G. (ed.) et al., Semigroups, categories, and partial algebras. ICSAA 2019. Proceedings of the conference, Kochi, India, December 9–12, 2019. Singapore: Springer. Springer Proc. Math. Stat. 345, 179-214 (2021). Reviewer: Peeter Normak (Tallinn) MSC: 20M18 18B40 20F29 PDF BibTeX XML Cite \textit{M. V. Lawson}, Springer Proc. Math. Stat. 345, 179--214 (2021; Zbl 1482.20034) Full Text: DOI arXiv OpenURL
Kupferman, Orna; Sickert, Salomon Certifying inexpressibility. (English) Zbl 07410435 Kiefer, Stefan (ed.) et al., Foundations of software science and computation structures. 24th international conference, FOSSACS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12650, 385-405 (2021). MSC: 68Nxx 68Qxx PDF BibTeX XML Cite \textit{O. Kupferman} and \textit{S. Sickert}, Lect. Notes Comput. Sci. 12650, 385--405 (2021; Zbl 07410435) Full Text: DOI arXiv OpenURL
Rabinovich Alexander; Tiferet, Doron Ambiguity hierarchy of regular infinite tree languages. (English) Zbl 07407790 Log. Methods Comput. Sci. 17, No. 3, Paper No. 18, 28 p. (2021). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{Rabinovich Alexander} and \textit{D. Tiferet}, Log. Methods Comput. Sci. 17, No. 3, Paper No. 18, 28 p. (2021; Zbl 07407790) Full Text: arXiv Link OpenURL
Kamilya, Supreeti; Kari, Jarkko Nilpotency and periodic points in non-uniform cellular automata. (English) Zbl 07374547 Acta Inf. 58, No. 4, 319-333 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{S. Kamilya} and \textit{J. Kari}, Acta Inf. 58, No. 4, 319--333 (2021; Zbl 07374547) Full Text: DOI OpenURL
Carton, Olivier; Vandehey, Joseph Preservation of normality by non-oblivious group selection. (English) Zbl 1477.68148 Theory Comput. Syst. 65, No. 2, 241-256 (2021). MSC: 68Q45 11K16 37B10 PDF BibTeX XML Cite \textit{O. Carton} and \textit{J. Vandehey}, Theory Comput. Syst. 65, No. 2, 241--256 (2021; Zbl 1477.68148) Full Text: DOI arXiv OpenURL
Blumensath, Achim Algebraic language theory for Eilenberg-Moore algebras. (English) Zbl 07350772 Log. Methods Comput. Sci. 17, No. 2, Paper No. 6, 60 p. (2021). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{A. Blumensath}, Log. Methods Comput. Sci. 17, No. 2, Paper No. 6, 60 p. (2021; Zbl 07350772) Full Text: arXiv Link OpenURL
Abram, William C.; Lagarias, Jeffrey C.; Slonim, Daniel J. Decimation and interleaving operations in one-sided symbolic dynamics. (English) Zbl 1477.37018 Adv. Appl. Math. 126, Article ID 102160, 59 p. (2021). Reviewer: Wolfgang Steiner (Paris) MSC: 37B10 37B40 11B25 18M65 PDF BibTeX XML Cite \textit{W. C. Abram} et al., Adv. Appl. Math. 126, Article ID 102160, 59 p. (2021; Zbl 1477.37018) Full Text: DOI arXiv OpenURL
Godard, Emmanuel; Perdereau, Eloi Back to the coordinated attack problem. (English) Zbl 07382043 Math. Struct. Comput. Sci. 30, No. 10, 1089-1113 (2020). MSC: 68-XX PDF BibTeX XML Cite \textit{E. Godard} and \textit{E. Perdereau}, Math. Struct. Comput. Sci. 30, No. 10, 1089--1113 (2020; Zbl 07382043) Full Text: DOI arXiv OpenURL
Das, Anupam; Riba, Colin A functional (monadic) second-order theory of infinite trees. (English) Zbl 07269253 Log. Methods Comput. Sci. 16, No. 4, Paper No. 6, 83 p. (2020). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{A. Das} and \textit{C. Riba}, Log. Methods Comput. Sci. 16, No. 4, Paper No. 6, 83 p. (2020; Zbl 07269253) Full Text: arXiv Link OpenURL
Zhang, Kuize; Giua, Alessandro On detectability of labeled Petri nets and finite automata. (English) Zbl 1448.93038 Discrete Event Dyn. Syst. 30, No. 3, 465-497 (2020). MSC: 93B07 93C65 68Q45 PDF BibTeX XML Cite \textit{K. Zhang} and \textit{A. Giua}, Discrete Event Dyn. Syst. 30, No. 3, 465--497 (2020; Zbl 1448.93038) Full Text: DOI arXiv OpenURL
Selivanov, Victor Well-quasi orders and hierarchy theory. (English) Zbl 07218745 Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 271-319 (2020). MSC: 03-XX PDF BibTeX XML Cite \textit{V. Selivanov}, Trends Log. Stud. Log. Libr. 53, 271--319 (2020; Zbl 07218745) Full Text: DOI arXiv OpenURL
Álvarez, Nicolás; Carton, Olivier On normality in shifts of finite type. (English) Zbl 1458.37016 Theory Comput. Syst. 64, No. 5, 783-798 (2020). Reviewer: Andreas Maletti (Leipzig) MSC: 37B15 37B51 11K16 68Q45 68P30 PDF BibTeX XML Cite \textit{N. Álvarez} and \textit{O. Carton}, Theory Comput. Syst. 64, No. 5, 783--798 (2020; Zbl 1458.37016) Full Text: DOI arXiv OpenURL
Blumensath, Achim; Wolf, Felix Bisimulation invariant monadic-second order logic in the finite. (English) Zbl 1484.03047 Theor. Comput. Sci. 823, 26-43 (2020). MSC: 03B70 03B16 03B45 PDF BibTeX XML Cite \textit{A. Blumensath} and \textit{F. Wolf}, Theor. Comput. Sci. 823, 26--43 (2020; Zbl 1484.03047) Full Text: DOI arXiv Link OpenURL
D’Angeli, Daniele; Godin, Thibault; Klimann, Ines; Picantin, Matthieu; Rodaro, Emanuele Boundary dynamics for bireversible and for contracting automaton groups. (English) Zbl 07181940 Int. J. Algebra Comput. 30, No. 2, 431-449 (2020). MSC: 20E08 20F10 68Q45 52C20 PDF BibTeX XML Cite \textit{D. D'Angeli} et al., Int. J. Algebra Comput. 30, No. 2, 431--449 (2020; Zbl 07181940) Full Text: DOI OpenURL
Ayyash, Mohammed Abu; Cherubini, Alessandra Some completely semisimple HNN-extensions of inverse semigroups. (English) Zbl 07181932 Int. J. Algebra Comput. 30, No. 2, 217-243 (2020). MSC: 20M18 20M05 PDF BibTeX XML Cite \textit{M. A. Ayyash} and \textit{A. Cherubini}, Int. J. Algebra Comput. 30, No. 2, 217--243 (2020; Zbl 07181932) Full Text: DOI OpenURL
Riba, Colin Monoidal-closed categories of tree automata. (English) Zbl 1435.68183 Math. Struct. Comput. Sci. 30, No. 1, 62-117 (2020). MSC: 68Q45 03B70 03D05 03G30 18B20 18D15 18M45 PDF BibTeX XML Cite \textit{C. Riba}, Math. Struct. Comput. Sci. 30, No. 1, 62--117 (2020; Zbl 1435.68183) Full Text: DOI OpenURL
Blumensath, Achim Regular tree algebras. (English) Zbl 07168152 Log. Methods Comput. Sci. 16, No. 1, Paper No. 16, 25 p. (2020). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{A. Blumensath}, Log. Methods Comput. Sci. 16, No. 1, Paper No. 16, 25 p. (2020; Zbl 07168152) Full Text: arXiv OpenURL
Chebotarev, A. N. Detecting fictitious states in a \(\Sigma \)-automaton synthesized from its specification in the language LP. (English. Russian original) Zbl 1448.68261 Cybern. Syst. Anal. 55, No. 5, 742-751 (2019); translation from Kibern. Sist. Anal. 2019, No. 5, 47-57 (2019). MSC: 68Q45 PDF BibTeX XML Cite \textit{A. N. Chebotarev}, Cybern. Syst. Anal. 55, No. 5, 742--751 (2019; Zbl 1448.68261); translation from Kibern. Sist. Anal. 2019, No. 5, 47--57 (2019) Full Text: DOI OpenURL
Pradic, Pierre; Riba, Colin A Curry-Howard approach to Church’s synthesis. (English) Zbl 07147442 Log. Methods Comput. Sci. 15, No. 4, Paper No. 13, 38 p. (2019). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{P. Pradic} and \textit{C. Riba}, Log. Methods Comput. Sci. 15, No. 4, Paper No. 13, 38 p. (2019; Zbl 07147442) Full Text: arXiv OpenURL
Bojańczyk, Mikołaj; Klin, Bartek A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra. (English) Zbl 1427.68178 Log. Methods Comput. Sci. 15, No. 4, Paper No. 11, 13 p. (2019). MSC: 68Q70 08A40 08A70 PDF BibTeX XML Cite \textit{M. Bojańczyk} and \textit{B. Klin}, Log. Methods Comput. Sci. 15, No. 4, Paper No. 11, 13 p. (2019; Zbl 1427.68178) Full Text: arXiv OpenURL
Bojańczyk, Mikołaj; Cavallari, Filippo; Place, Thomas; Skrzypczak, Michał Regular tree languages in low levels of the wadge hierarchy. (English) Zbl 07104935 Log. Methods Comput. Sci. 15, No. 3, Paper No. 27, 61 p. (2019). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{M. Bojańczyk} et al., Log. Methods Comput. Sci. 15, No. 3, Paper No. 27, 61 p. (2019; Zbl 07104935) Full Text: arXiv OpenURL
Angluin, Dana; Antonopoulos, Timos; Fisman, Dana Query learning of derived \(\omega\)-tree languages in polynomial time. (English) Zbl 1434.68210 Log. Methods Comput. Sci. 15, No. 3, Paper No. 21, 29 p. (2019). MSC: 68Q32 68Q25 68Q45 PDF BibTeX XML Cite \textit{D. Angluin} et al., Log. Methods Comput. Sci. 15, No. 3, Paper No. 21, 29 p. (2019; Zbl 1434.68210) Full Text: arXiv 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
Kołodziejczyk, Leszek; Michalewski, Henryk; Pradic, Pierre; Skrzypczak, Michał The logical strength of Büchi’s decidability theorem. (English) Zbl 07058775 Log. Methods Comput. Sci. 15, No. 2, Paper No. 16, 31 p. (2019). MSC: 03D05 03B25 03F35 PDF BibTeX XML Cite \textit{L. Kołodziejczyk} et al., Log. Methods Comput. Sci. 15, No. 2, Paper No. 16, 31 p. (2019; Zbl 07058775) Full Text: arXiv 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
Karandikar, Prateek; Schnoebelen, Philippe The height of piecewise-testable languages and the complexity of the logic of subwords. (English) Zbl 1421.68063 Log. Methods Comput. Sci. 15, No. 2, Paper No. 6, 27 p. (2019). MSC: 68Q19 03B70 68Q45 PDF BibTeX XML Cite \textit{P. Karandikar} and \textit{P. Schnoebelen}, Log. Methods Comput. Sci. 15, No. 2, Paper No. 6, 27 p. (2019; Zbl 1421.68063) Full Text: arXiv OpenURL
Cabessa, Jérémie; Finkel, Olivier Computational capabilities of analog and evolving neural networks over infinite input streams. (English) Zbl 1410.68120 J. Comput. Syst. Sci. 101, 86-99 (2019). MSC: 68Q05 68Q45 92B20 PDF BibTeX XML Cite \textit{J. Cabessa} and \textit{O. Finkel}, J. Comput. Syst. Sci. 101, 86--99 (2019; Zbl 1410.68120) Full Text: DOI HAL OpenURL
Angluin, Dana; Fisman, Dana Regular \(\omega\)-languages with an informative right congruence. (English) Zbl 07447748 Orlandini, Andrea (ed.) et al., Proceedings of the ninth international symposium on games, automata, logics, and formal verification, GandALF 2018, Saarbrücken, Germany, September 26–28, 2018. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 277, 265-279 (2018). MSC: 68Q45 68Q60 91A80 PDF BibTeX XML Cite \textit{D. Angluin} and \textit{D. Fisman}, Electron. Proc. Theor. Comput. Sci. (EPTCS) 277, 265--279 (2018; Zbl 07447748) Full Text: arXiv Link OpenURL
Brengos, Tomasz A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves. (English) Zbl 07378569 Schewe, Sven (ed.) et al., 29th international conference on concurrency theory. CONCUR 2018, Beijing, China, September 4–7, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 118, Article 25, 18 p. (2018). MSC: 68Q85 PDF BibTeX XML Cite \textit{T. Brengos}, LIPIcs -- Leibniz Int. Proc. Inform. 118, Article 25, 18 p. (2018; Zbl 07378569) Full Text: DOI OpenURL
Wilke, Thomas Backward deterministic Büchi automata on infinite words. (English) Zbl 07278078 Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 6, 9 p. (2018). MSC: 68N30 68Qxx PDF BibTeX XML Cite \textit{T. Wilke}, LIPIcs -- Leibniz Int. Proc. Inform. 93, Article 6, 9 p. (2018; Zbl 07278078) Full Text: DOI OpenURL
Charlier, Émilie First-order logic and numeration systems. (English) Zbl 07006267 Berthé, Valérie (ed.) et al., Sequences, groups, and number theory. Cham: Birkhäuser. Trends Math., 89-141 (2018). MSC: 03C07 03C62 03D05 PDF BibTeX XML Cite \textit{É. Charlier}, in: Sequences, groups, and number theory. Cham: Birkhäuser. 89--141 (2018; Zbl 07006267) Full Text: DOI OpenURL
Berthé, Valérie; Rigo, Michel General framework. (English) Zbl 1407.11044 Berthé, Valérie (ed.) et al., Sequences, groups, and number theory. Cham: Birkhäuser. Trends Math., 1-36 (2018). MSC: 11B85 11-02 05A05 11A63 68Q45 PDF BibTeX XML Cite \textit{V. Berthé} and \textit{M. Rigo}, in: Sequences, groups, and number theory. Cham: Birkhäuser. 1--36 (2018; Zbl 1407.11044) Full Text: DOI OpenURL
Carton, Olivier; Colcombet, Thomas; Puppis, Gabriele An algebraic approach to MSO-definability on countable linear orderings. (English) Zbl 06966190 J. Symb. Log. 83, No. 3, 1147-1189 (2018). MSC: 03-XX PDF BibTeX XML Cite \textit{O. Carton} et al., J. Symb. Log. 83, No. 3, 1147--1189 (2018; Zbl 06966190) Full Text: DOI arXiv OpenURL
Bedon, Nicolas Complementation of branching automata for scattered and countable \(N\)-free posets. (English) Zbl 1403.68110 Int. J. Found. Comput. Sci. 29, No. 5, 769-799 (2018). MSC: 68Q45 06A06 PDF BibTeX XML Cite \textit{N. Bedon}, Int. J. Found. Comput. Sci. 29, No. 5, 769--799 (2018; Zbl 1403.68110) Full Text: DOI OpenURL
Kuske, Dietrich; Liu, Jiamou; Moskvina, Anastasia Infinite and bi-infinite words with decidable monadic theories. (English) Zbl 06932680 Log. Methods Comput. Sci. 14, No. 3, Paper No. 9, 24 p. (2018). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{D. Kuske} et al., Log. Methods Comput. Sci. 14, No. 3, Paper No. 9, 24 p. (2018; Zbl 06932680) Full Text: DOI arXiv OpenURL
Kari, Jarkko; Salo, Ville; Worsch, Thomas Sequentializing cellular automata. (English) Zbl 06916380 Baetens, Jan M. (ed.) et al., Cellular automata and discrete complex systems. 24th IFIP WG 1.5 international workshop, AUTOMATA 2018, Ghent, Belgium, June 20–22, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10875, 72-87 (2018). MSC: 68Q80 PDF BibTeX XML Cite \textit{J. Kari} et al., Lect. Notes Comput. Sci. 10875, 72--87 (2018; Zbl 06916380) Full Text: DOI arXiv Link OpenURL
Fisman, Dana Inferring regular languages and \(\omega\)-languages. (English) Zbl 1394.68211 J. Log. Algebr. Methods Program. 98, 27-49 (2018). MSC: 68Q45 68Q32 PDF BibTeX XML Cite \textit{D. Fisman}, J. Log. Algebr. Methods Program. 98, 27--49 (2018; Zbl 1394.68211) Full Text: DOI OpenURL
Patey, Ludovic; Yokoyama, Keita The proof-theoretic strength of Ramsey’s theorem for pairs and two colors. (English) Zbl 1469.03033 Adv. Math. 330, 1034-1070 (2018). MSC: 03B30 03F35 05D10 03H15 03C62 03D80 PDF BibTeX XML Cite \textit{L. Patey} and \textit{K. Yokoyama}, Adv. Math. 330, 1034--1070 (2018; Zbl 1469.03033) Full Text: DOI arXiv OpenURL
Droste, Manfred; Ésik, Zoltán; Kuich, Werner The triple-pair construction for weighted \(\omega\)-pushdown automata. (English) Zbl 1483.68163 Csuhaj-Varjú, Erzsébet (ed.) et al., Proceedings of the 15th international conference on automata and formal languages, AFL’17, Debrecen, Hungary, September 4–6, 2017. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 101-113 (2017). MSC: 68Q45 16Y60 68Q70 PDF BibTeX XML Cite \textit{M. Droste} et al., Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 101--113 (2017; Zbl 1483.68163) Full Text: arXiv Link OpenURL
Pradic, Pierre; Riba, Colin A Curry-Howard approach to Church’s synthesis. (English) Zbl 1434.03104 Miller, Dale (ed.), 2nd international conference on formal structures for computation and deduction. FSCD 2017, Oxford, UK, September 3–9, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 84, Article 30, 16 p. (2017). MSC: 03D05 03B16 03F35 03F55 68Q45 PDF BibTeX XML Cite \textit{P. Pradic} and \textit{C. Riba}, LIPIcs -- Leibniz Int. Proc. Inform. 84, Article 30, 16 p. (2017; Zbl 1434.03104) Full Text: DOI OpenURL
Cavallari, Filippo; Michalewski, Henryk; Skrzypczak, Michał A characterisation of \(\Pi^0_2\) regular tree languages. (English) Zbl 1441.68118 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 56, 14 p. (2017). MSC: 68Q45 PDF BibTeX XML Cite \textit{F. Cavallari} et al., LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 56, 14 p. (2017; Zbl 1441.68118) Full Text: DOI OpenURL
Rafilipojaona, Fanasina Lower bounds on the weak Schur numbers up to 9 colors. (English) Zbl 1414.05294 Integers 17, Paper A39, 35 p. (2017). MSC: 05D10 PDF BibTeX XML Cite \textit{F. Rafilipojaona}, Integers 17, Paper A39, 35 p. (2017; Zbl 1414.05294) Full Text: Link OpenURL
Asher, Nicholas; Paul, Soumya; Venant, Antoine Message exchange games in strategic contexts. (English) Zbl 1417.03205 J. Philos. Log. 46, No. 4, 355-404 (2017). MSC: 03B65 91A28 91A80 03A05 PDF BibTeX XML Cite \textit{N. Asher} et al., J. Philos. Log. 46, No. 4, 355--404 (2017; Zbl 1417.03205) Full Text: DOI Link OpenURL
Chaturvedi, Namit; Gelderie, Marcus Classifying recognizable infinitary trace languages using word automata. (English) Zbl 1376.68085 Inf. Comput. 256, 23-34 (2017). MSC: 68Q45 68Q85 PDF BibTeX XML Cite \textit{N. Chaturvedi} and \textit{M. Gelderie}, Inf. Comput. 256, 23--34 (2017; Zbl 1376.68085) Full Text: DOI OpenURL
Salo, Ville Decidability and universality of quasiminimal subshifts. (English) Zbl 1372.68103 J. Comput. Syst. Sci. 89, 288-314 (2017). MSC: 68Q05 37B10 37B50 68Q45 68Q60 PDF BibTeX XML Cite \textit{V. Salo}, J. Comput. Syst. Sci. 89, 288--314 (2017; Zbl 1372.68103) Full Text: DOI arXiv OpenURL
Hoffmann, Stefan; Schwarz, Sibylle; Staiger, Ludwig Shift-invariant topologies for the Cantor space \(X^{\omega}\). (English) Zbl 1386.68090 Theor. Comput. Sci. 679, 145-161 (2017). Reviewer: Cristian S. Calude (Auckland) MSC: 68Q45 PDF BibTeX XML Cite \textit{S. Hoffmann} et al., Theor. Comput. Sci. 679, 145--161 (2017; Zbl 1386.68090) Full Text: DOI OpenURL
Degano, Pierpaolo; Ferrari, Gian-Luigi; Mezzetti, Gianluca Regular and context-free nominal traces. (English) Zbl 1376.68087 Acta Inf. 54, No. 4, 399-433 (2017). Reviewer: Francesco Dolce (Montréal) MSC: 68Q45 PDF BibTeX XML Cite \textit{P. Degano} et al., Acta Inf. 54, No. 4, 399--433 (2017; Zbl 1376.68087) Full Text: DOI OpenURL
Bélair, Luc; Gélinas, Maxime; Point, Françoise Recognizable sets of power series over finite fields. (Ensembles reconnaissables de séries formelles sur un corps fini.) (French. English summary) Zbl 1387.03035 C. R., Math., Acad. Sci. Paris 354, No. 3, 225-229 (2016). MSC: 03D05 03B25 PDF BibTeX XML Cite \textit{L. Bélair} et al., C. R., Math., Acad. Sci. Paris 354, No. 3, 225--229 (2016; Zbl 1387.03035) Full Text: DOI OpenURL
Asher, Nicholas; Paul, Soumya Language games. (English) Zbl 1482.68226 Amblard, Maxime (ed.) et al., Logical aspects of computational linguistics. Celebrating 20 years of LACL (1996–2016). 9th international conference, LACL 2016, Nancy, France, December 5–7, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10054, 1-17 (2016). MSC: 68T27 03B65 91A44 PDF BibTeX XML Cite \textit{N. Asher} and \textit{S. Paul}, Lect. Notes Comput. Sci. 10054, 1--17 (2016; Zbl 1482.68226) Full Text: DOI Link OpenURL
Fleischer, Lukas; Kufleitner, Manfred Operations on weakly recognizing morphisms. (English) Zbl 1476.68159 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, 126-137 (2016). MSC: 68Q70 20M35 PDF BibTeX XML Cite \textit{L. Fleischer} and \textit{M. Kufleitner}, Lect. Notes Comput. Sci. 9777, 126--137 (2016; Zbl 1476.68159) Full Text: DOI arXiv Link OpenURL
Ésik, Zoltán; Iván, Szabolcs MSO-definable properties of Muller context-free languages are decidable. (English) Zbl 1476.03050 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, 87-97 (2016). MSC: 03D05 PDF BibTeX XML Cite \textit{Z. Ésik} and \textit{S. Iván}, Lect. Notes Comput. Sci. 9777, 87--97 (2016; Zbl 1476.03050) Full Text: DOI Link OpenURL
Finkel, Olivier Infinite games specified by 2-tape automata. (English) Zbl 1422.03113 Ann. Pure Appl. Logic 167, No. 12, 1184-1212 (2016). MSC: 03E60 03E35 03D05 68Q45 68Q15 68Q17 03E15 PDF BibTeX XML Cite \textit{O. Finkel}, Ann. Pure Appl. Logic 167, No. 12, 1184--1212 (2016; Zbl 1422.03113) Full Text: DOI arXiv OpenURL
Cabessa, Jérémie; Villa, Alessandro E. P. Expressive power of first-order recurrent neural networks determined by their attractor dynamics. (English) Zbl 1351.68097 J. Comput. Syst. Sci. 82, No. 8, 1232-1250 (2016). Reviewer: T. C. Mohan (Chennai) MSC: 68Q05 68Q10 68Q45 68T05 92B20 PDF BibTeX XML Cite \textit{J. Cabessa} and \textit{A. E. P. Villa}, J. Comput. Syst. Sci. 82, No. 8, 1232--1250 (2016; Zbl 1351.68097) Full Text: DOI OpenURL
Kufleitner, Manfred; Wächter, Jan Philipp The word problem for omega-terms over the Trotter-Weil hierarchy (extended abstract). (English) Zbl 1386.20037 Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 11th international computer science symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9–13, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-34170-5/pbk; 978-3-319-34171-2/ebook). Lecture Notes in Computer Science 9691, 237-250 (2016). MSC: 20M05 03B25 03D05 03D40 PDF BibTeX XML Cite \textit{M. Kufleitner} and \textit{J. P. Wächter}, Lect. Notes Comput. Sci. 9691, 237--250 (2016; Zbl 1386.20037) Full Text: DOI arXiv OpenURL
Kufleitner, Manfred; Walter, Tobias Level two of the quantifier alternation hierarchy over infinite words. (English) Zbl 1386.03043 Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 11th international computer science symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9–13, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-34170-5/pbk; 978-3-319-34171-2/ebook). Lecture Notes in Computer Science 9691, 223-236 (2016). MSC: 03D05 03B25 03C13 PDF BibTeX XML Cite \textit{M. Kufleitner} and \textit{T. Walter}, Lect. Notes Comput. Sci. 9691, 223--236 (2016; Zbl 1386.03043) Full Text: DOI arXiv Link OpenURL
Idziaszek, Tomasz; Skrzypczak, Michał; Bojańczyk, Mikołaj Regular languages of thin trees. (English) Zbl 1350.68173 Theory Comput. Syst. 58, No. 4, 614-663 (2016). Reviewer: Saeed Salehi (Tabriz) MSC: 68Q45 PDF BibTeX XML Cite \textit{T. Idziaszek} et al., Theory Comput. Syst. 58, No. 4, 614--663 (2016; Zbl 1350.68173) Full Text: DOI Link OpenURL
Finkel, Olivier Incompleteness theorems, large cardinals, and automata over infinite words. (English) Zbl 1440.03056 Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part II. Berlin: Springer. Lect. Notes Comput. Sci. 9135, 222-233 (2015). MSC: 03D05 03E15 03E35 03E55 PDF BibTeX XML Cite \textit{O. Finkel}, Lect. Notes Comput. Sci. 9135, 222--233 (2015; Zbl 1440.03056) Full Text: DOI HAL OpenURL
Becher, Verónica; Carton, Olivier; Heiber, Pablo Ariel Normality and automata. (English) Zbl 1329.68156 J. Comput. Syst. Sci. 81, No. 8, 1592-1613 (2015). Reviewer: Andreas Maletti (Stuttgart) MSC: 68Q45 68Q10 PDF BibTeX XML Cite \textit{V. Becher} et al., J. Comput. Syst. Sci. 81, No. 8, 1592--1613 (2015; Zbl 1329.68156) Full Text: DOI OpenURL
Finkel, Olivier; Lecomte, Dominique; Simonnet, Pierre An upper bound on the complexity of recognizable tree languages. (English) Zbl 1373.03066 RAIRO, Theor. Inform. Appl. 49, No. 2, 121-137 (2015). MSC: 03D05 03E15 03B70 68Q45 68Q15 PDF BibTeX XML Cite \textit{O. Finkel} et al., RAIRO, Theor. Inform. Appl. 49, No. 2, 121--137 (2015; Zbl 1373.03066) Full Text: DOI arXiv OpenURL
Diekert, Volker; Kufleitner, Manfred Omega-rational expressions with bounded synchronization delay. (English) Zbl 1343.68135 Theory Comput. Syst. 56, No. 4, 686-696 (2015). Reviewer: Aleksandr V. Tishchenko (Moskva) MSC: 68Q45 20M35 PDF BibTeX XML Cite \textit{V. Diekert} and \textit{M. Kufleitner}, Theory Comput. Syst. 56, No. 4, 686--696 (2015; Zbl 1343.68135) Full Text: DOI Link OpenURL
Janin, David On labeled birooted tree languages: algebras, automata and logic. (English) Zbl 1353.68187 Inf. Comput. 243, 222-248 (2015). MSC: 68Q70 03D05 20M35 PDF BibTeX XML Cite \textit{D. Janin}, Inf. Comput. 243, 222--248 (2015; Zbl 1353.68187) Full Text: DOI OpenURL
Charlier, Émilie; Leroy, Julien; Rigo, Michel An analogue of Cobham’s theorem for graph directed iterated function systems. (English) Zbl 1332.28013 Adv. Math. 280, 86-120 (2015). Reviewer: Peter Massopust (München) MSC: 28A80 03D05 PDF BibTeX XML Cite \textit{É. Charlier} et al., Adv. Math. 280, 86--120 (2015; Zbl 1332.28013) Full Text: DOI arXiv OpenURL
Coulouma, Étienne; Godard, Emmanuel; Peters, Joseph A characterization of oblivious message adversaries for which consensus is solvable. (English) Zbl 1315.68008 Theor. Comput. Sci. 584, 80-90 (2015). MSC: 68M10 PDF BibTeX XML Cite \textit{É. Coulouma} et al., Theor. Comput. Sci. 584, 80--90 (2015; Zbl 1315.68008) Full Text: DOI OpenURL
Fu, Hao; Han, Guo-Niu On \(t\)-extensions of the Hankel determinants of certain automatic sequences. (English) Zbl 1353.11054 Theor. Comput. Sci. 562, 46-56 (2015). MSC: 11B85 11C20 05A05 05A19 11B75 PDF BibTeX XML Cite \textit{H. Fu} and \textit{G.-N. Han}, Theor. Comput. Sci. 562, 46--56 (2015; Zbl 1353.11054) Full Text: DOI arXiv OpenURL
Mogavero, Fabio; Murano, Aniello; Perelli, Giuseppe; Vardi, Moshe Y. Reasoning about strategies: on the model-checking problem. (English) Zbl 1354.68178 ACM Trans. Comput. Log. 15, No. 4, Article No. 34, 47 p. (2014). MSC: 68Q60 68T27 91A80 PDF BibTeX XML Cite \textit{F. Mogavero} et al., ACM Trans. Comput. Log. 15, No. 4, Article No. 34, 47 p. (2014; Zbl 1354.68178) Full Text: DOI arXiv OpenURL
Konovalov, A. S.; Selivanov, V. L. Boolean algebras of regular languages. (English. Russian original) Zbl 1312.68119 Algebra Logic 52, No. 6, 448-470 (2014); translation from Algebra Logika 52, No. 6, 676-711 (2013). MSC: 68Q45 06E05 PDF BibTeX XML Cite \textit{A. S. Konovalov} and \textit{V. L. Selivanov}, Algebra Logic 52, No. 6, 448--470 (2014; Zbl 1312.68119); translation from Algebra Logika 52, No. 6, 676--711 (2013) Full Text: DOI OpenURL
Dennunzio, Alberto; Formenti, Enrico; Provillard, Julien Three research directions in non-uniform cellular automata. (English) Zbl 1360.68611 Theor. Comput. Sci. 559, 73-90 (2014). MSC: 68Q80 37B10 37B15 PDF BibTeX XML Cite \textit{A. Dennunzio} et al., Theor. Comput. Sci. 559, 73--90 (2014; Zbl 1360.68611) Full Text: DOI OpenURL
Rodaro, Emanuele; Silva, Pedro V. Fixed points of endomorphisms of trace monoids. (English) Zbl 1309.20052 Semigroup Forum 89, No. 1, 266-279 (2014). Reviewer: Volodymyr Mazorchuk (Uppsala) MSC: 20M35 20M05 68Q45 PDF BibTeX XML Cite \textit{E. Rodaro} and \textit{P. V. Silva}, Semigroup Forum 89, No. 1, 266--279 (2014; Zbl 1309.20052) Full Text: DOI arXiv OpenURL
Abram, William C.; Lagarias, Jeffrey C. Path sets in one-sided symbolic dynamics. (English) Zbl 1347.37027 Adv. Appl. Math. 56, 109-134 (2014). MSC: 37B10 28A80 54H20 37B40 PDF BibTeX XML Cite \textit{W. C. Abram} and \textit{J. C. Lagarias}, Adv. Appl. Math. 56, 109--134 (2014; Zbl 1347.37027) Full Text: DOI arXiv OpenURL
Finkel, Olivier; Skrzypczak, Michał On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets. (English) Zbl 1358.68211 Inf. Process. Lett. 114, No. 5, 229-233 (2014). MSC: 68Q85 68Q45 PDF BibTeX XML Cite \textit{O. Finkel} and \textit{M. Skrzypczak}, Inf. Process. Lett. 114, No. 5, 229--233 (2014; Zbl 1358.68211) Full Text: DOI arXiv Link OpenURL
Křena, Bohuslav; Vojnar, Tomáš Automated formal analysis and verification: an overview. (English) Zbl 1286.68318 Int. J. Gen. Syst. 42, No. 4, 335-365 (2013). MSC: 68Q60 68T15 68N30 PDF BibTeX XML Cite \textit{B. Křena} and \textit{T. Vojnar}, Int. J. Gen. Syst. 42, No. 4, 335--365 (2013; Zbl 1286.68318) Full Text: DOI OpenURL
Skrzypczak, Michał Topological extension of parity automata. (English) Zbl 1358.03048 Inf. Comput. 228-229, 16-27 (2013). MSC: 03D05 03E15 68Q45 PDF BibTeX XML Cite \textit{M. Skrzypczak}, Inf. Comput. 228--229, 16--27 (2013; Zbl 1358.03048) Full Text: DOI OpenURL
Aubrun, Nathalie; Béal, Marie-Pierre Sofic tree-shifts. (English) Zbl 1293.68195 Theory Comput. Syst. 53, No. 4, 621-644 (2013). Reviewer: Thomas B. Ward (Durham) MSC: 68Q70 37B10 68Q45 PDF BibTeX XML Cite \textit{N. Aubrun} and \textit{M.-P. Béal}, Theory Comput. Syst. 53, No. 4, 621--644 (2013; Zbl 1293.68195) Full Text: DOI Link OpenURL
Demri, Stéphane On selective unboundedness of VASS. (English) Zbl 1285.68094 J. Comput. Syst. Sci. 79, No. 5, 689-713 (2013). MSC: 68Q60 PDF BibTeX XML Cite \textit{S. Demri}, J. Comput. Syst. Sci. 79, No. 5, 689--713 (2013; Zbl 1285.68094) Full Text: DOI arXiv OpenURL
Sugiyama, Mahito; Hirowatari, Eiju; Tsuiki, Hideki; Yamamoto, Akihiro Learning figures with the Hausdorff metric by fractals – towards computable binary classification. (English) Zbl 1260.68345 Mach. Learn. 90, No. 1, 91-126 (2013). MSC: 68T05 28A78 28A80 PDF BibTeX XML Cite \textit{M. Sugiyama} et al., Mach. Learn. 90, No. 1, 91--126 (2013; Zbl 1260.68345) Full Text: DOI OpenURL
Sutner, Klaus Computational classification of cellular automata. (English) Zbl 1283.68232 Int. J. Gen. Syst. 41, No. 6, 595-607 (2012). MSC: 68Q80 68Q32 PDF BibTeX XML Cite \textit{K. Sutner}, Int. J. Gen. Syst. 41, No. 6, 595--607 (2012; Zbl 1283.68232) Full Text: DOI OpenURL
Rabinovich, Alexander The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates. (English) Zbl 1285.03005 Inf. Comput. 218, 1-16 (2012). Reviewer: Mihai Prunescu (Bucharest) MSC: 03B25 03B15 03C85 PDF BibTeX XML Cite \textit{A. Rabinovich}, Inf. Comput. 218, 1--16 (2012; Zbl 1285.03005) Full Text: DOI OpenURL
Bedon, Nicolas; Rispal, Chloé Schützenberger and Eilenberg theorems for words on linear orderings. (English) Zbl 1279.68129 J. Comput. Syst. Sci. 78, No. 2, 517-536 (2012). MSC: 68Q45 68Q70 68R15 PDF BibTeX XML Cite \textit{N. Bedon} and \textit{C. Rispal}, J. Comput. Syst. Sci. 78, No. 2, 517--536 (2012; Zbl 1279.68129) Full Text: DOI OpenURL
Finkel, Olivier; Todorčević, Stevo A hierarchy of tree-automatic structures. (English) Zbl 1241.03041 J. Symb. Log. 77, No. 1, 350-368 (2012). MSC: 03C57 03D05 03E35 03E50 PDF BibTeX XML Cite \textit{O. Finkel} and \textit{S. Todorčević}, J. Symb. Log. 77, No. 1, 350--368 (2012; Zbl 1241.03041) Full Text: DOI arXiv Euclid OpenURL
Finkel, Olivier Some problems in automata theory which depend on the models of set theory. (English) Zbl 1232.68082 RAIRO, Theor. Inform. Appl. 45, No. 4, 383-397 (2011). MSC: 68Q45 68Q15 03D05 03D10 PDF BibTeX XML Cite \textit{O. Finkel}, RAIRO, Theor. Inform. Appl. 45, No. 4, 383--397 (2011; Zbl 1232.68082) Full Text: DOI arXiv EuDML OpenURL
Blumensath, Achim Recognisability for algebras of infinite trees. (English) Zbl 1233.68159 Theor. Comput. Sci. 412, No. 29, 3463-3486 (2011). Reviewer: Magnus Steinby (Turku) MSC: 68Q70 08A70 03B70 PDF BibTeX XML Cite \textit{A. Blumensath}, Theor. Comput. Sci. 412, No. 29, 3463--3486 (2011; Zbl 1233.68159) Full Text: DOI OpenURL
Akiyama, Shigeki; Loridant, Benoît Boundary parametrization of self-affine tiles. (English) Zbl 1226.28006 J. Math. Soc. Japan 63, No. 2, 525-579 (2011). Reviewer: Zu-Guo Yu (Xiangtan) MSC: 28A80 52C20 68Q70 PDF BibTeX XML Cite \textit{S. Akiyama} and \textit{B. Loridant}, J. Math. Soc. Japan 63, No. 2, 525--579 (2011; Zbl 1226.28006) Full Text: DOI OpenURL
Diekert, Volker; Kufleitner, Manfred Fragments of first-order logic over infinite words. (English) Zbl 1258.03045 Theory Comput. Syst. 48, No. 3, 486-516 (2011). MSC: 03D05 03B20 68Q45 PDF BibTeX XML Cite \textit{V. Diekert} and \textit{M. Kufleitner}, Theory Comput. Syst. 48, No. 3, 486--516 (2011; Zbl 1258.03045) Full Text: DOI Link OpenURL
Silva, Pedro V. Fixed points of endomorphisms over special confluent rewriting systems. (English) Zbl 1236.20063 Monatsh. Math. 161, No. 4, 417-447 (2010). Reviewer: Francine Blanchet-Sadri (Greensboro) MSC: 20M35 68R15 20F67 68Q42 37B10 68Q70 20E36 PDF BibTeX XML Cite \textit{P. V. Silva}, Monatsh. Math. 161, No. 4, 417--447 (2010; Zbl 1236.20063) Full Text: DOI OpenURL
Finkel, Olivier On some sets of dictionaries whose \(\omega\)-powers have a given complexity. (English) Zbl 1203.03067 Math. Log. Q. 56, No. 5, 452-460 (2010). MSC: 03E15 54H05 68Q15 68Q45 PDF BibTeX XML Cite \textit{O. Finkel}, Math. Log. Q. 56, No. 5, 452--460 (2010; Zbl 1203.03067) Full Text: DOI arXiv OpenURL
Finkel, Olivier; Todorčević, Stevo The isomorphism relation between tree-automatic structures. (English) Zbl 1207.03050 Cent. Eur. J. Math. 8, No. 2, 299-313 (2010). MSC: 03D05 03C52 03C62 03E15 PDF BibTeX XML Cite \textit{O. Finkel} and \textit{S. Todorčević}, Cent. Eur. J. Math. 8, No. 2, 299--313 (2010; Zbl 1207.03050) Full Text: DOI arXiv OpenURL
Bès, Alexis; Rabinovich, Alexander Decidable expansions of labelled linear orderings. (English) Zbl 1287.03025 Blass, Andreas (ed.) et al., Fields of logic and computation. Essays dedicated to Yuri Gurevich on the occasion of his 70th birthday. Berlin: Springer (ISBN 978-3-642-15024-1/pbk). Lecture Notes in Computer Science 6300, 95-107 (2010). MSC: 03B25 06A05 PDF BibTeX XML Cite \textit{A. Bès} and \textit{A. Rabinovich}, Lect. Notes Comput. Sci. 6300, 95--107 (2010; Zbl 1287.03025) Full Text: DOI OpenURL
Rodríguez-López, J.; Romaguera, S.; Sánchez-Álvarez, J. M. The Hausdorff fuzzy quasi-metric. (English) Zbl 1205.54015 Fuzzy Sets Syst. 161, No. 8, 1078-1096 (2010). Reviewer: Fu-Gui Shi (Beijing) MSC: 54A40 03E72 54E35 PDF BibTeX XML Cite \textit{J. Rodríguez-López} et al., Fuzzy Sets Syst. 161, No. 8, 1078--1096 (2010; Zbl 1205.54015) Full Text: DOI OpenURL
Rodaro, Emanuele Bicyclic subsemigroups in amalgams of finite inverse semigroups. (English) Zbl 1201.20061 Int. J. Algebra Comput. 20, No. 1, 89-113 (2010). Reviewer: G. I. Zhitomirskij (Herzliyya) MSC: 20M18 20M05 PDF BibTeX XML Cite \textit{E. Rodaro}, Int. J. Algebra Comput. 20, No. 1, 89--113 (2010; Zbl 1201.20061) Full Text: DOI OpenURL
Colcombet, Thomas Factorization forests for infinite words and applications to countable scattered linear orderings. (English) Zbl 1183.68336 Theor. Comput. Sci. 411, No. 4-5, 751-764 (2010). MSC: 68Q45 PDF BibTeX XML Cite \textit{T. Colcombet}, Theor. Comput. Sci. 411, No. 4--5, 751--764 (2010; Zbl 1183.68336) Full Text: DOI OpenURL
Beauquier, Danièle; Cohen, Joëlle; Lanotte, Ruggero Security policies enforcement using finite edit automata. (English) Zbl 1291.68279 Bonchi, Filippo (ed.) et al., Proceedings of the 1st interaction and concurrency experiences workshop (ICE 2008), Reykjavik, Iceland, July 6, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 229, No. 3, 19-35 (2009). MSC: 68Q85 68Q45 PDF BibTeX XML Cite \textit{D. Beauquier} et al., Electron. Notes Theor. Comput. Sci. 229, No. 3, 19--35 (2009; Zbl 1291.68279) Full Text: DOI OpenURL
Bauer, Andreas; Pinchinat, Sophie Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective. (English) Zbl 1180.93064 Discrete Event Dyn. Syst. 19, No. 4, 451-470 (2009). MSC: 93C65 68N30 PDF BibTeX XML Cite \textit{A. Bauer} and \textit{S. Pinchinat}, Discrete Event Dyn. Syst. 19, No. 4, 451--470 (2009; Zbl 1180.93064) Full Text: DOI OpenURL
Rabinovich, Alexander Decidable extensions of Church’s problem. (English) Zbl 1257.03034 Grädel, Erich (ed.) et al., Computer science logic. 23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7–11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04026-9/pbk). Lecture Notes in Computer Science 5771, 424-439 (2009). MSC: 03B25 PDF BibTeX XML Cite \textit{A. Rabinovich}, Lect. Notes Comput. Sci. 5771, 424--439 (2009; Zbl 1257.03034) Full Text: DOI Link OpenURL
Marín, Josefa Weak bases and quasi-pseudo-metrization of bispaces. (English) Zbl 1178.54013 Topology Appl. 156, No. 18, 3070-3076 (2009). MSC: 54E55 54E35 54E20 54E30 PDF BibTeX XML Cite \textit{J. Marín}, Topology Appl. 156, No. 18, 3070--3076 (2009; Zbl 1178.54013) Full Text: DOI OpenURL
Chadha, Rohit; Sistla, A. Prasad; Viswanathan, Mahesh Power of randomization in automata on infinite strings. (English) Zbl 1254.68131 Bravetti, Mario (ed.) et al., CONCUR 2009 – concurrency theory. 20th international conference, CONCUR 2009, Bologna, Italy, September 1–4, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04080-1/pbk). Lecture Notes in Computer Science 5710, 229-243 (2009). MSC: 68Q45 68Q87 PDF BibTeX XML Cite \textit{R. Chadha} et al., Lect. Notes Comput. Sci. 5710, 229--243 (2009; Zbl 1254.68131) Full Text: DOI arXiv OpenURL
Boigelot, Bernard; Brusten, Julien; Leroux, Jérôme A generalization of Semenov’s theorem to automata over real numbers. (English) Zbl 1250.03061 Schmidt, Renate A. (ed.), Automated deduction – CADE-22. 22nd international conference on automated deduction, Montreal, Canada, August 2–7, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02958-5/pbk). Lecture Notes in Computer Science 5663. Lecture Notes in Artificial Intelligence, 469-484 (2009). MSC: 03D05 68Q45 PDF BibTeX XML Cite \textit{B. Boigelot} et al., Lect. Notes Comput. Sci. 5663, 469--484 (2009; Zbl 1250.03061) Full Text: DOI HAL OpenURL
Goldwasser, John; Wang, Xinmao; Wu, Yaokun Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? (English) Zbl 1169.91011 Eur. J. Comb. 30, No. 4, 774-787 (2009). Reviewer: Giacomo Bonanno (Davis) MSC: 91A43 91A46 PDF BibTeX XML Cite \textit{J. Goldwasser} et al., Eur. J. Comb. 30, No. 4, 774--787 (2009; Zbl 1169.91011) Full Text: DOI OpenURL
Finkel, Olivier Highly undecidable problems for infinite computations. (English) Zbl 1171.03024 Theor. Inform. Appl. 43, No. 2, 339-364 (2009). MSC: 03D35 03D05 68Q05 68Q45 PDF BibTeX XML Cite \textit{O. Finkel}, Theor. Inform. Appl. 43, No. 2, 339--364 (2009; Zbl 1171.03024) Full Text: DOI EuDML OpenURL