Ultrametric Algorithms and Automata
From MaRDI portal
Publication:2945554
DOI10.1007/978-3-319-21819-9_2zbMath1390.68308OpenAlexW2234535675MaRDI QIDQ2945554
Publication date: 14 September 2015
Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21819-9_2
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- On rank vs. communication complexity
- Polynomial degree vs. quantum query complexity
- NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
- Complexity of probabilistic versus deterministic automata
- Ultrametric Finite Automata and Turing Machines
- Ultrametric Analysis and Interbasin Kinetics
- Generalized Automata and Stochastic Languages
- Quantum computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Ultrametric Algorithms and Automata
