Location of Repository

Generating functions of timed languages

By Eugene Asarin, Nicolas Basset, Aldric Degorre and Dominique Perrin

Abstract

International audienceIn order to study precisely the growth of timed languages, we associate to such a language a generating function. These functions (tightly related to volume and entropy of timed languages) satisfy compositionality properties and can be characterized by integral equations. We provide procedures for computation of generating functions for some classes of timed automata and regular expressions

Topics: timed automata, timed languages, generating functions, F.4.3, [ INFO.INFO-FL ] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [ INFO.INFO-IT ] Computer Science [cs]/Information Theory [cs.IT], [ MATH.MATH-IT ] Mathematics [math]/Information Theory [math.IT], [ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]
Publisher: HAL CCSD
Year: 2012
DOI identifier: 10.1007/978-3-642-32589-2_14
OAI identifier: oai:HAL:hal-00678443v2
Provided by: Hal-Diderot

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.