Ultrametric algorithms and automata
From MaRDI portal
Publication:2945554
Recommendations
Cites work
- scientific article; zbMATH DE number 1199695 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 846429 (Why is no real title available?)
- scientific article; zbMATH DE number 3209170 (Why is no real title available?)
- Complexity of probabilistic versus deterministic automata
- Generalized Automata and Stochastic Languages
- NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
- On rank vs. communication complexity
- Polynomial degree vs. quantum query complexity
- Quantum computing
- Ultrametric Analysis and Interbasin Kinetics
- Ultrametric finite automata and Turing machines
Cited in
(7)- On the hierarchy classes of finite ultrametric automata
- Ultrametric vs. quantum query algorithms
- The \(p\)-adic theory of automata functions
- Thinking ultrametrically, thinking \(p\)-adically
- Towards \(p\)-adic artificial language
- Capabilities of ultrametric automata with one, two, and three states
- Ultrametric finite automata and Turing machines
This page was built for publication: Ultrametric algorithms and automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945554)