Amount of Nonconstructivity in Finite Automata
From MaRDI portal
Publication:3637360
DOI10.1007/978-3-642-02979-0_26zbMath1248.03057OpenAlexW1576097144MaRDI QIDQ3637360
Publication date: 9 July 2009
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02979-0_26
Automata and formal grammars in connection with logical questions (03D05) Algorithmic randomness and dimension (03D32)
Related Items
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 text
Cites Work
- Turing machines that take advice
- Polynomial time quantum computation with advice
- NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
- Automata that take advice
- The definition of random sequences
- Some remarks on the theory of graphs
- SOFSEM 2004: Theory and Practice of Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item