We prove that the class of the languages recognized by one-way deterministic 1-reversal bounded 1-counter machines is contained in RCM, a class of languages that has been recently introduced and that admits interesting properties. This is the first step to prove the conjecture LDFCM ⊊ RCM, which says that for any fixed integer k all the languages recognized by one-way deterministic 1-reversal bounded k-counter machines are in RCM. We recall that this conjecture implies that the generating function of a language in LDFCM is holonomic.

On the conjecture LDFCM ⊊ RCM

MASSAZZA, PAOLO
2017-01-01

Abstract

We prove that the class of the languages recognized by one-way deterministic 1-reversal bounded 1-counter machines is contained in RCM, a class of languages that has been recently introduced and that admits interesting properties. This is the first step to prove the conjecture LDFCM ⊊ RCM, which says that for any fixed integer k all the languages recognized by one-way deterministic 1-reversal bounded k-counter machines are in RCM. We recall that this conjecture implies that the generating function of a language in LDFCM is holonomic.
2017
Implementation and Application of Automata
9783319601335
22nd International Conference Implementation and Application of Automata CIAA 2017
Université Paris-Est Marne-la-Vallée
27--30 June 2017
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/2063732
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

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