One-Counter Automata with Counter Observability

Benedikt Bollig (1, 2)

1 MEXICO - Modeling and Exploitation of Interaction and Concurrency
2 LSV - Laboratoire Spécification et Vérification [Cachan]

In a one-counter automaton (OCA), one can produce a letter from some finite alphabet, increment and decrement the counter by one, or compare it with constants up to some threshold. It is well-known that universality and language inclusion for OCAs are undecidable. In this paper, we consider OCAs with counter observability: Whenever the automaton produces a letter, it outputs the current counter value along with it. Hence, its language is now a set of words over an infinite alphabet. We show that universality and inclusion for that model are PSPACE-complete, thus no harder than the corresponding problems for finite automata. In fact, by establishing a link with visibly one-counter automata, we show that OCAs with counter observability are e ectively determinizable and closed under all boolean operations. Moreover, it turns out that they are expressively equivalent to strong automata, in which transitions are guarded by MSO formulas over the natural numbers with successor.

Domaines: Théorie et langage formel [cs.FL]

Benedikt Bollig. One-Counter Automata with Counter Observability. 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), Dec 2016, Chennai, India. ⟨10.4230/LIPIcs.FSTTCS.2016⟩. ⟨hal-01407932⟩