Defines occupation ideals from Parikh monomials of trajectories in directed support graphs of Markov chains to encode distinct occupation patterns and separate reachability, trajectory, and occupation-pattern growth.
Parikh’s theorem: A simple and direct automaton construction
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
citing papers explorer
-
Occupation Ideals and Parikh Images in Markov Support Dynamics
Defines occupation ideals from Parikh monomials of trajectories in directed support graphs of Markov chains to encode distinct occupation patterns and separate reachability, trajectory, and occupation-pattern growth.
- The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages