Determinization of ordinal automata
From MaRDI portal
Recommendations
- Finite automata and ordinals
- Automata on Ordinals and Linear Orders
- Ordinal automata and Cantor normal form
- Automata on ordinals and automaticity of linear orders
- Determinization of Büchi-Automata
- On varieties of ordered automata
- DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
- Determinization of logical specifications of automata
- scientific article; zbMATH DE number 4055923
- A note on ordinal DFAs
Cites work
- scientific article; zbMATH DE number 1189233 (Why is no real title available?)
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- A combinatorial approach to the theory of ω-automata
- Decision methods in the theory of ordinals
- Testing and generating infinite sequences by a finite automaton
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(6)
This page was built for publication: Determinization of ordinal automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383176)