Recommendations
Quantum versus deterministic counter automata
This paper focuses on quantum analogues of various models of counter automata, and almost completely proves the relation between the classes of languages recognizable by bounded error quantum ones and classical deterministic ones in every model of ...
Flat Parametric Counter Automata
Machines, Computations and Universality, Part IIIn this paper we study the reachability problem for parametric flat counter automata, in relation with the satisfiability problem of three fragments of integer arithmetic. The equivalence between non-parametric flat counter automata and Presburger ...
Flat Parametric Counter Automata
Machines, Computations and Universality, Part IIIn this paper we study the reachability problem for parametric flat counter automata, in relation with the satisfiability problem of three fragments of integer arithmetic. The equivalence between non-parametric flat counter automata and Presburger ...
Comments