The Černý conjecture for automata respecting intervals of a directed graph.
Mariusz GrechAndrzej KisielewiczPublished in: Discret. Math. Theor. Comput. Sci. (2013)
Keyphrases
- directed graph
- random walk
- cellular automata
- finite state
- probabilistic automata
- graph structure
- disjoint paths
- maximum flow
- finite automata
- shortest path problem
- undirected graph
- regular expressions
- web graph
- directed acyclic graph
- graph structures
- lattice gas
- directed edges
- search space
- strongly connected
- turing machine
- finite state machines
- learning algorithm