Generating Functions of Timed Languages

DOI10.1007/978-3-642-32589-2_14MaRDI QIDQ2912714zbMATH OpenOpenAlexFDO

Authors Eugene Asarin, Nicolas Basset, Aldric Degorre, Dominique Perrin

Publication date 25 September 2012

Published in Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32589-2_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4116001
• Counting and Generating Permutations Using Timed Languages
• Foundations of Software Science and Computation Structures
• A Machine-Independent Characterization of Timed Languages
• A logical characterization of timed regular languages
• Language equations for timed alternating finite automata
• A logical characterization of timed (non-)regular languages
• On timed regular languages defined by inverse monoid morphisms
• Formal Methods for the Design of Real-Time Systems
• Thin and thick timed regular languages

Cited in

(10)

• Entropy of regular timed languages
• A maximal entropy stochastic process for a timed automaton
• Two size measures for timed languages
• Timed symbolic dynamics
• Volume and Entropy of Regular Timed Languages: Discretization Approach
• Volume and entropy of regular timed languages: analytic approach
• scientific article; zbMATH DE number 739127 (Why is no real title available?)
• Foundations of Software Science and Computation Structures
• Counting and Generating Permutations Using Timed Languages
• Counting and generating permutations in regular classes

This page was built for publication: Generating Functions of Timed Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912714)