Repository landing page
research
Generating functions of timed languages
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- info:eu-repo/semantics/conferenceObject
- Conference papers
- 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]
Similar works
This paper was published in Hal-Diderot.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.