counter_automata_deterministic (329B)
1 # Deterministic counter automata 2 3 for every *reachable* configuration (state, counter states), for every letter, there is at most one transition which is applicable (= whose guard is satisfied) 4 5 Up: [counter_automata_definition], [automata_deterministic] 6 7 Aliases: deterministic counter automata, deterministic counter automaton