Counting with probabilistic and ultrametric finite automata

DOI10.1007/978-3-319-13350-8_1zbMATH Open1323.68336OpenAlexW86814122MaRDI QIDQ2944874FDOQ2944874

Authors: Kaspars Balodis 

Publication date: 8 September 2015

Published in: Computing with New Resources (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13350-8_1

Recommendations

• On the hierarchy classes of finite ultrametric automata
• scientific article; zbMATH DE number 4092773
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
• The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
• scientific article; zbMATH DE number 4209603

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic automata
• A \(p\)-adic model of DNA sequence and genetic code
• Title not available (Why is that?)
• Succinct representation of regular languages by Boolean automata
• Generalized Automata and Stochastic Languages
• Ultrametric Analysis and Interbasin Kinetics
• Two-way automata and length-preserving homomorphisms
• One alternation can be more powerful than randomization in small and fast two-way finite automata

Cited In (6)

• On the hierarchy classes of finite ultrametric automata
• Title not available (Why is that?)
• Ultrametric finite automata and Turing machines
• Title not available (Why is that?)
• Capabilities of ultrametric automata with one, two, and three states
• On a conjecture by Christian Choffrut

Uses Software

• Easychair

This page was built for publication: Counting with probabilistic and ultrametric finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944874)