Ramaswamy, Vidhya; Sarma, Jayalal; Sunil, K. S. Space complexity of reachability testing in labelled graphs. (English) Zbl 1425.68322 J. Comput. Syst. Sci. 105, 40-53 (2019). MSC: 68R10 05C25 05C78 68Q17 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Ramaswamy, Vidhya; Sarma, Jayalal; Sunil, K. S. Space complexity of reachability testing in labelled graphs. (English) Zbl 1425.68321 Drewes, Frank (ed.) et al., Language and automata theory and applications. 11th international conference, LATA 2017, Umeå, Sweden, March 6–9, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10168, 351-363 (2017). MSC: 68R10 05C25 05C78 68Q17 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Beaudry, Martin; Dubé, Danny; Dubé, Maxime; Latendresse, Mario; Tesson, Pascal Conservative groupoids recognize only regular languages. (English) Zbl 1309.68132 Inf. Comput. 239, 13-28 (2014). MSC: 68Q70 × Cite Format Result Cite Review PDF Full Text: DOI
Moore, Cristopher; Thérien, Denis; Lemieux, François; Berman, Joshua; Drisko, Arthur Circuits and expressions with nonassociative gates. (English) Zbl 0955.68053 J. Comput. Syst. Sci. 60, No. 2, 368-394 (2000). MSC: 68Q15 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Beaudry, Martin Languages recognized by finite aperiodic groupoids. (English) Zbl 0912.68110 Theor. Comput. Sci. 209, No. 1-2, 299-317 (1998). MSC: 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Beaudry, Martin; Lemieux, François; Thérien, Denis Finite loops recognize exactly the regular open languages. (English) Zbl 1401.68213 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 110-120 (1997). MSC: 68Q70 × Cite Format Result Cite Review PDF Full Text: DOI