We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Software Engineering/Polishness of some topologies related to word or tree automata
MagazinesSoftware Engineering

Polishness of some topologies related to word or tree automata

Checking your access to this record.

Abstract & Overview

We prove that the B\"uchi topology and the automatic topology are Polish. We also show that this cannot be fully extended to the case of a space of infinite labelled binary trees; in particular the B\"uchi and the Muller topologies are not Polish in this case.

Cite this record

Olivier Finkel, Olivier Carton, Dominique Lecomte (2019). Polishness of some topologies related to word or tree automata. Logical Methods in Computer Science e.V.. https://library.shubhaarti.com/content/e4ec4eae-3250-486e-9e07-fc05f0560e17

Copy in another style

Finkel, O., Carton, O., & Lecomte, D. (2019). Polishness of some topologies related to word or tree automata. Logical Methods in Computer Science e.V.. https://library.shubhaarti.com/content/e4ec4eae-3250-486e-9e07-fc05f0560e17
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.