Ultrametric algorithms and automata

DOI10.1007/978-3-319-21819-9_2MaRDI QIDQ2945554zbMATH OpenOpenAlexFDO

Authors Rūsiņš Freivalds

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Ultrametric finite automata and Turing machines
• Capabilities of ultrametric automata with one, two, and three states
• Ultrametric vs. quantum query algorithms
• On the hierarchy classes of finite ultrametric automata
• The \(p\)-adic theory of automata functions

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)

• Ultrametric vs. quantum query algorithms
• On the hierarchy classes of finite ultrametric automata
• Ultrametric finite automata and Turing machines
• Capabilities of ultrametric automata with one, two, and three states
• Towards p-adic artificial language
• Thinking ultrametrically, thinking p-adically
• The \(p\)-adic theory of automata functions

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)