Star-height of Parikh images is bounded by 2 for one-register automata but the rational conjecture fails for multiple registers, showing Parikh's theorem does not hold over infinite alphabets.
[CG18] Andrea Celli and Nicola Gatti
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.
Proves CLS-hardness for Nash equilibrium computation in two-team polymatrix games with zero-sum or coordination pairwise payoffs, with tight CLS membership when one team has independent adversaries, plus an ε-Nash algorithm with 1/ε² runtime dependence.
citing papers explorer
-
Star Complexity of Parikh Images of Languages over Infinite Alphabets
Star-height of Parikh images is bounded by 2 for one-register automata but the rational conjecture fails for multiple registers, showing Parikh's theorem does not hold over infinite alphabets.
-
Visibly Recursive Automata
Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.
-
The Complexity of Two-Team Polymatrix Games with Independent Adversaries
Proves CLS-hardness for Nash equilibrium computation in two-team polymatrix games with zero-sum or coordination pairwise payoffs, with tight CLS membership when one team has independent adversaries, plus an ε-Nash algorithm with 1/ε² runtime dependence.