Search

• < Previous
• 1
• Next >

Computing the Width of Non-deterministic Automata

We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly on any accepted input. We describe an incremental&nbsp;[&hellip;]