Counting authorised paths in constrained control-flow graphs
Résumé
Our goal in this extended abstract is to investigate a model of computation inspired by control-flow graphs, automata and arithmetic circuits. The objective is to extend the definition of the first to include computing on nodes and edges.
Domaines
Mathématique discrète [cs.DM]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...