Counting with Probabilistic and Ultrametric Finite Automata

DOI10.1007/978-3-319-13350-8_1zbMath1323.68336OpenAlexW86814122MaRDI QIDQ2944874

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

Mathematics Subject Classification ID

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

Related Items (1)

On a Conjecture by Christian Choffrut

Uses Software

• Easychair

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A \(p\)-adic model of DNA sequence and genetic code
• Succinct representation of regular languages by Boolean automata
• One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata
• Two-way automata and length-preserving homomorphisms
• Ultrametric Analysis and Interbasin Kinetics
• Probabilistic automata
• Generalized Automata and Stochastic Languages

This page was built for publication: Counting with Probabilistic and Ultrametric Finite Automata