Automata transformations of prefix decidable and decidable by Buchi superwords
From MaRDI portal
Publication:309440
DOI10.3103/S1066369X16070070zbMATH Open1420.68108MaRDI QIDQ309440FDOQ309440
Authors: N. N. Korneeva 
Publication date: 7 September 2016
Published in: Russian Mathematics (Search for Journal in Brave)
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
automata transformation[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=B%EF%BF%BD%EF%BF%BDchi+superword&go=Go B��chi superword]monadic theoryprefix decidability
Cites Work
- Title not available (Why is that?)
- Uniform tag sequences
- Iteration of maps by an automaton
- Almost periodic sequences.
- Finite-automaton transformations of strictly almost-periodic sequences
- Sequences close to periodic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability conditions for problems about automata reading infinite words
- Degrees of asynchronously automaton transformations
- Automaton transformations and monadic theories of infinite sequences
- Almost periodicity, finite automata mappings, and related effectiveness issues
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)
