We prove that the generating function of a language accepted by a one-way deterministic one-reversal counter machine without negative cycles is holonomic. The result is achieved by solving a particular case of the conjecture L _DFCM=RCM. Here, RCM is a class of languages that has been recently introduced and that admits some interesting properties , namely it contains only languages with holonomic generating function .

On the generating functions of languages accepted by deterministic one-reversal counter machines

P. Massazza
2018-01-01

Abstract

We prove that the generating function of a language accepted by a one-way deterministic one-reversal counter machine without negative cycles is holonomic. The result is achieved by solving a particular case of the conjecture L _DFCM=RCM. Here, RCM is a class of languages that has been recently introduced and that admits some interesting properties , namely it contains only languages with holonomic generating function .
2018
ICTCS 2018 Italian Conference on Theoretical Computer Science. Proceedings of the 19th Italian Conference on Theoretical Computer Science Urbino, Italy, September 18-20, 2018.
ICTCS 2018
Urbino, Italy
18-20 settembre 2018
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11383/2074952
 Attenzione

L'Ateneo sottopone a validazione solo i file PDF allegati

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
social impact