Amount of Nonconstructivity in Finite Automata
From MaRDI portal
Recommendations
- Amount of nonconstructivity in deterministic finite automata
- On the amount of nonconstructivity in learning recursive functions
- On the amount of nonconstructivity in learning formal languages from positive data
- On the amount of nonconstructivity in learning formal languages from text
- NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
Cites work
- Automata that take advice
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 1390024 (Why is no real title available?)
- scientific article; zbMATH DE number 3307567 (Why is no real title available?)
- scientific article; zbMATH DE number 3363526 (Why is no real title available?)
- NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
- Polynomial time quantum computation with advice
- SOFSEM 2004: Theory and Practice of Computer Science
- Some remarks on the theory of graphs
- The definition of random sequences
- The mathematics of coding theory. Information, compression, error correction and finite fields.
- Turing machines that take advice
Cited in
(4)
This page was built for publication: Amount of Nonconstructivity in Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637360)