Goubault-Larrecq, Jean; Halfon, Simon; Karandikar, Prateek; Kumar, K. Narayan; Schnoebelen, Philippe The ideal approach to computing closed subsets in well-quasi-orderings. (English) Zbl 1446.68191 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, 55-105 (2020). MSC: 68W05 03E05 PDFBibTeX XMLCite \textit{J. Goubault-Larrecq} et al., Trends Log. Stud. Log. Libr. 53, 55--105 (2020; Zbl 1446.68191) Full Text: DOI arXiv HAL
Sorouhesh, Mohammad Reza On ideals of quasi-commutative semigroups. (English) Zbl 1470.20030 Bull. Iran. Math. Soc. 45, No. 2, 447-453 (2019). MSC: 20M05 20M99 PDFBibTeX XMLCite \textit{M. R. Sorouhesh}, Bull. Iran. Math. Soc. 45, No. 2, 447--453 (2019; Zbl 1470.20030) Full Text: DOI
Finkel, Olivier Locally finite \(\omega\)-languages and effective analytic sets have the same topological complexity. (English) Zbl 1432.03073 Math. Log. Q. 62, No. 4-5, 303-318 (2016). MSC: 03D05 03E15 68Q45 PDFBibTeX XMLCite \textit{O. Finkel}, Math. Log. Q. 62, No. 4--5, 303--318 (2016; Zbl 1432.03073) Full Text: DOI HAL
Glaßer, Christian; Schmitz, Heinz; Selivanov, Victor Efficient algorithms for membership in Boolean hierarchies of regular languages. (English) Zbl 1348.68103 Theor. Comput. Sci. 646, 86-108 (2016). MSC: 68Q45 68Q15 PDFBibTeX XMLCite \textit{C. Glaßer} et al., Theor. Comput. Sci. 646, 86--108 (2016; Zbl 1348.68103) Full Text: DOI
Pin, Jean-Éric Theme and variations on the concatenation product. (English) Zbl 1307.68052 Winkler, Franz (ed.), Algebraic informatics. 4th international conference, CAI 2011, Linz, Austria, June 21–24, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21492-9/pbk). Lecture Notes in Computer Science 6742, 44-64 (2011). MSC: 68Q70 03D05 68Q45 PDFBibTeX XMLCite \textit{J.-É. Pin}, Lect. Notes Comput. Sci. 6742, 44--64 (2011; Zbl 1307.68052) Full Text: DOI HAL
Eiter, Thomas; Gottlob, Georg; Schwentick, Thomas The model checking problem for prefix classes of second-order logic: a survey. (English) Zbl 1287.68107 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, 227-250 (2010). MSC: 68Q60 03B15 03C13 68Q45 68-02 PDFBibTeX XMLCite \textit{T. Eiter} et al., Lect. Notes Comput. Sci. 6300, 227--250 (2010; Zbl 1287.68107) Full Text: DOI
Ésik, Zoltán; Weil, Pascal Algebraic characterization of logically defined tree languages. (English) Zbl 1196.68150 Int. J. Algebra Comput. 20, No. 2, 195-239 (2010). Reviewer: Magnus Steinby (Turku) MSC: 68Q70 03B70 08A70 68Q45 PDFBibTeX XMLCite \textit{Z. Ésik} and \textit{P. Weil}, Int. J. Algebra Comput. 20, No. 2, 195--239 (2010; Zbl 1196.68150) Full Text: DOI
Cabessa, Jérémie; Duparc, Jacques A game theoretical approach to the algebraic counterpart of the Wagner hierarchy. I. (English) Zbl 1175.03021 Theor. Inform. Appl. 43, No. 3, 443-461 (2009). MSC: 03D05 03E15 20M35 68Q70 91A65 PDFBibTeX XMLCite \textit{J. Cabessa} and \textit{J. Duparc}, Theor. Inform. Appl. 43, No. 3, 443--461 (2009; Zbl 1175.03021) Full Text: DOI EuDML
Héam, P.-C. A note on partially ordered tree automata. (English) Zbl 1191.68387 Inf. Process. Lett. 108, No. 4, 242-246 (2008). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. C. Héam}, Inf. Process. Lett. 108, No. 4, 242--246 (2008; Zbl 1191.68387) Full Text: DOI HAL
Diekert, Volker; Gastin, Paul; Kufleitner, Manfred A survey on small fragments of first-order logic over finite words. (English) Zbl 1157.03003 Int. J. Found. Comput. Sci. 19, No. 3, 513-548 (2008). Reviewer: Alex Nabebin (Moskva) MSC: 03B20 03B25 03D05 68Q45 PDFBibTeX XMLCite \textit{V. Diekert} et al., Int. J. Found. Comput. Sci. 19, No. 3, 513--548 (2008; Zbl 1157.03003) Full Text: DOI
Finkel, Olivier Topological complexity of locally finite \(\omega\)-languages. (English) Zbl 1145.03018 Arch. Math. Logic 47, No. 6, 625-651 (2008). MSC: 03D05 03E15 68Q45 PDFBibTeX XMLCite \textit{O. Finkel}, Arch. Math. Logic 47, No. 6, 625--651 (2008; Zbl 1145.03018) Full Text: DOI
Carton, Olivier; Finkel, Olivier; Simonnet, Pierre On the continuity set of an omega rational function. (English) Zbl 1149.03028 Theor. Inform. Appl. 42, No. 1, 183-196 (2008). MSC: 03D05 68Q45 PDFBibTeX XMLCite \textit{O. Carton} et al., Theor. Inform. Appl. 42, No. 1, 183--196 (2008; Zbl 1149.03028) Full Text: DOI arXiv EuDML
Cabessa, Jérémie; Duparc, Jacques The algebraic counterpart of the Wagner hierarchy. (English) Zbl 1143.68047 Beckmann, Arnold (ed.) et al., Logic and theory of algorithms. 4th conference on computability in Europe, CiE 2008, Athens, Greece, June 15–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69405-2/pbk). Lecture Notes in Computer Science 5028, 100-109 (2008). MSC: 68Q70 03E15 91A44 PDFBibTeX XMLCite \textit{J. Cabessa} and \textit{J. Duparc}, Lect. Notes Comput. Sci. 5028, 100--109 (2008; Zbl 1143.68047) Full Text: DOI
Pin, Jean-Eric Expressive power of existential first-order sentences of Büchi’s sequential calculus. (English) Zbl 1058.03038 Discrete Math. 291, No. 1-3, 155-174 (2005). MSC: 03D05 20M35 68Q45 68Q70 PDFBibTeX XMLCite \textit{J.-E. Pin}, Discrete Math. 291, No. 1--3, 155--174 (2005; Zbl 1058.03038) Full Text: DOI
Finkel, Olivier Closure properties of locally finite \(\omega\)-languages. (English) Zbl 1070.68067 Theor. Comput. Sci. 322, No. 1, 69-84 (2004). MSC: 68Q45 03D05 PDFBibTeX XMLCite \textit{O. Finkel}, Theor. Comput. Sci. 322, No. 1, 69--84 (2004; Zbl 1070.68067) Full Text: DOI
Finkel, Olivier Undecidability of topological and arithmetical properties of infinitary rational relations. (English) Zbl 1112.03312 Theor. Inform. Appl. 37, No. 2, 115-126 (2003). MSC: 03D05 03D55 03E15 68Q45 PDFBibTeX XMLCite \textit{O. Finkel}, Theor. Inform. Appl. 37, No. 2, 115--126 (2003; Zbl 1112.03312) Full Text: DOI Numdam EuDML
Finkel, Olivier On the topological complexity of infinitary rational relations. (English) Zbl 1112.03313 Theor. Inform. Appl. 37, No. 2, 105-113 (2003). MSC: 03D05 03D55 03E15 68Q45 PDFBibTeX XMLCite \textit{O. Finkel}, Theor. Inform. Appl. 37, No. 2, 105--113 (2003; Zbl 1112.03313) Full Text: DOI arXiv Numdam EuDML
Ésik, Zoltán; Larsen, Kim G. Regular languages definable by Lindström quantifiers. (English) Zbl 1046.20042 Theor. Inform. Appl. 37, No. 3, 179-241 (2003). Reviewer: Francine Blanchet-Sadri (Greensboro) MSC: 20M35 68Q45 68Q60 68Q70 03C07 PDFBibTeX XMLCite \textit{Z. Ésik} and \textit{K. G. Larsen}, Theor. Inform. Appl. 37, No. 3, 179--241 (2003; Zbl 1046.20042) Full Text: Numdam EuDML
Almeida, Jorge; Zeitoun, Marc Tameness of some locally trivial pseudovarieties. (English) Zbl 1027.20034 Commun. Algebra 31, No. 1, 61-77 (2003). Reviewer: Tero J.Harju (Turku) MSC: 20M07 20M05 20M35 PDFBibTeX XMLCite \textit{J. Almeida} and \textit{M. Zeitoun}, Commun. Algebra 31, No. 1, 61--77 (2003; Zbl 1027.20034) Full Text: DOI
Pin, Jean-Eric Algebraic tools for the concatenation product. (English) Zbl 1064.68057 Theor. Comput. Sci. 292, No. 1, 317-342 (2003). MSC: 68Q45 68Q70 PDFBibTeX XMLCite \textit{J.-E. Pin}, Theor. Comput. Sci. 292, No. 1, 317--342 (2003; Zbl 1064.68057) Full Text: DOI
Bedon, Nicolas Star-free sets of words on ordinals. (English) Zbl 1007.68095 Inf. Comput. 166, No. 2, 93-111 (2001). MSC: 68Q45 03D05 PDFBibTeX XMLCite \textit{N. Bedon}, Inf. Comput. 166, No. 2, 93--111 (2001; Zbl 1007.68095) Full Text: DOI
Finkel, O. Locally finite languages. (English) Zbl 0974.68096 Theor. Comput. Sci. 255, No. 1-2, 223-261 (2001). MSC: 68Q45 PDFBibTeX XMLCite \textit{O. Finkel}, Theor. Comput. Sci. 255, No. 1--2, 223--261 (2001; Zbl 0974.68096) Full Text: DOI
Pin, J.-E.; Weil, P. Polynomial closure and unambiguous product. (English) Zbl 0872.68119 Theory Comput. Syst. 30, No. 4, 383-422 (1997). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. E. Pin} and \textit{P. Weil}, Theory Comput. Syst. 30, No. 4, 383--422 (1997; Zbl 0872.68119) Full Text: DOI
Pin, Jean-Eric Polynomial closure of group languages and open sets of the Hall topology. (English) Zbl 0877.68076 Theor. Comput. Sci. 169, No. 2, 185-200 (1996). MSC: 68Q45 PDFBibTeX XMLCite \textit{J.-E. Pin}, Theor. Comput. Sci. 169, No. 2, 185--200 (1996; Zbl 0877.68076) Full Text: DOI