×

Found 13 Documents (Results 1–13)

Minimizing GFG transition-based automata. (English) Zbl 1527.68120

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 100, 16 p. (2019).
MSC:  68Q45 68Q25
PDFBibTeX XMLCite
Full Text: DOI

A novel learning algorithm for Büchi automata based on family of DFAs and classification trees. (English) Zbl 1453.68098

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, 208-226 (2017).
MSC:  68Q32 68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Complexity of aperiodicity for topological properties of regular \(\omega \)-languages. (English) Zbl 1143.68039

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, 533-543 (2008).
PDFBibTeX XMLCite
Full Text: DOI

A polynomial time algorithm for the equivalence of two morphisms on \(\omega\)-regular languages. (English) Zbl 0797.68082

Enjalbert, Patrice (ed.) et al., STACS 93. 10th annual symposium on theoretical aspects of computer science, Würzburg, Germany, February 25-27, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 665, 595-606 (1993).
MSC:  68Q25 68Q45
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software