6533b7ddfe1ef96bd1273d3b
RESEARCH PRODUCT
Counting with Probabilistic and Ultrametric Finite Automata
Kaspars Balodissubject
Discrete mathematicsFinite-state machineState complexityUnary languageProbabilistic logicQuantum finite automataNonlinear Sciences::Cellular Automata and Lattice GasesUltrametric spaceComputer Science::Formal Languages and Automata TheoryMathematicsAutomatondescription
We investigate the state complexity of probabilistic and ultrametric finite automata for the problem of counting, i.e. recognizing the one-word unary language \(C_n=\left\{ 1^n \right\} \). We also review the known results for other types of automata.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2014-01-01 |