On a class of languages with holonomic generating functions

Giuseppa Castiglione, Paolo Massazza

Risultato della ricerca: Article

5 Citazioni (Scopus)

Abstract

We define a class of languages (RCM) obtained by considering Regular languages, linear Constraints on the number of occurrences of symbols and Morphisms. The class RCM presents some interesting closure properties, and contains languages with holonomic generating functions. As a matter of fact, RCM is related to one-way 1-reversal bounded k-counter machines and also to Parikh automata on letters. Indeed, RCM is contained in L-NFCM but not in L-DFCM, and strictly includes L-CPA. We conjecture that L-DFCM subset of RCM
Lingua originaleEnglish
pagine (da-a)74-84
Numero di pagine11
RivistaTheoretical Computer Science
Volume658
Stato di pubblicazionePublished - 2017

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cita questo