IO-PP[<] recognizes exactly the unambiguous star-free languages; stabilization is undecidable for PP[<] and IO-PP[+1] but conditionally decidable for IO-PP[<].
Unambiguous constrained Automata
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Population Protocols over Ordered Agents
IO-PP[<] recognizes exactly the unambiguous star-free languages; stabilization is undecidable for PP[<] and IO-PP[+1] but conditionally decidable for IO-PP[<].