Ultrametric algorithms and automata

DOI10.1007/978-3-319-21819-9_2zbMATH Open1390.68308OpenAlexW2234535675MaRDI QIDQ2945554FDOQ2945554

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial degree vs. quantum query complexity
• On rank vs. communication complexity
• Quantum computing
• NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
• Generalized Automata and Stochastic Languages
• Complexity of probabilistic versus deterministic automata
• Ultrametric Analysis and Interbasin Kinetics
• Ultrametric finite automata and Turing machines
• Title not available (Why is that?)

Cited In (1)

• 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)