Skip to main content

All Questions

Filter by
Sorted by
Tagged with
6 votes
2 answers
647 views

Deterministic finite-state automaton driven by a Markov chain

I've stumbled on some problem, and I have the feeling that this is closed to something well-studied in dynamical systems. The problem is the following. Consider a finite-state automaton with state ...
Peva Blanchard's user avatar
4 votes
2 answers
227 views

Given an automatic set $S$ coming from a DFA $M$ when read little-endian, is $\overline{d}(S)$ at most the Büchi acceptance probability of $M$?

Note: I've entirely rewritten this question! Originally it was just the third formulation, take note of that when reading answers. Let's say $S$ is a $b$-automatic set, and let's say $M$ is a DFA ...
Harry Altman's user avatar
  • 2,585
1 vote
1 answer
160 views

Optimum control of a probabilistic automaton

Suppose we have a probabilistic automaton and we assign a weight to each state. An "interaction strategy" would be a fixed map from states to inputs. Any interaction strategy could be used to ...
Joseph Soulbringer's user avatar
0 votes
1 answer
95 views

On the behaviour of individual random walks of a Markov Chain

My current research (on Probabilistic Automaton) brought me to the following question regarding Markov Chains. I state the definitions for the sake of clarity. Let $M$ be a discrete-time finite Markov ...
santi cifu's user avatar