All Questions

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 ...

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 ...

I am kind of new to timed automata and I have a question related to their correctness and synchronisation. Assume that I have three states, A, B and C. I have also two clocks, $x$ and $y$ that are ...

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 ...

My motivation for this question comes from the study of synchronizing automata. There is a general consensus that random automata are synchronizing and have short synchronizing words. I am hoping ...