Automata transformations of prefix decidable and decidable by Buchi superwords
From MaRDI portal
Recommendations
- The structure of degrees of finite-automaton transformations of prefix decidable superwords
- On automaton determinisation of sets of superwords
- Determinization of Büchi-Automata
- Precomplete classes of automata with the superposition operation
- Prefix pushdown automata and their simplification
- Implementation and Application of Automata
- Observations on determinization of Büchi automata
- Deternimization of Büchi automata as partitioned automata
- scientific article; zbMATH DE number 1354849
- Determinization of Büchi automata: unifying the approaches of Safra and Muller-Schupp
Cites work
- scientific article; zbMATH DE number 3976344 (Why is no real title available?)
- scientific article; zbMATH DE number 3634246 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- Almost periodic sequences.
- Almost periodicity, finite automata mappings, and related effectiveness issues
- Automaton transformations and monadic theories of infinite sequences
- Decidability conditions for problems about automata reading infinite words
- Degrees of asynchronously automaton transformations
- Finite-automaton transformations of strictly almost-periodic sequences
- Iteration of maps by an automaton
- Sequences close to periodic
- Uniform tag sequences
Cited in
(3)
This page was built for publication: Automata transformations of prefix decidable and decidable by Buchi superwords
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309440)
