Parameterized Games and Parameterized Automata
We introduce a way to parameterize automata and games on finite graphs with natural numbers. The parameters are accessed essentially by allowing counting down from the parameter value to 0 and branching depending on whether 0 has been reached. The main technical result is that in games, a player can...
Main Author: | Arno Pauly |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2018-09-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1809.03093v1 |
Similar Items
-
Classical and parameterized complexity of cliques and games
by: Scott, Allan Edward Jolicoeur
Published: (2008) -
Sequentializing Parameterized Programs
by: Salvatore La Torre, et al.
Published: (2012-07-01) -
Parameterizing convective organization
by: Brian Earle Mapes, et al.
Published: (2011-06-01) -
PARAMETERIZATIONS OF ANALYTIC VARIETIES
by: BECKER, JOSEPH ABRAHAM
Published: (2007) -
Optimal Parameterization of SNFS
by: Silverman Robert D.
Published: (2007-04-01)