📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

A Novel Family of Finite Automata for Recognizing and Learning $$\omega $$-Regular Languages

First Author: Li Y

Attributed to: Below the Branches of Universal Trees funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-031-45329-8_3

Publication URI: http://dx.doi.org/10.1007/978-3-031-45329-8_3

Type: Book Chapter

Book Title: Automated Technology for Verification and Analysis - 21st International Symposium, ATVA 2023, Singapore, October 24-27, 2023, Proceedings, Part I (2023)

Page Reference: 53-73