An algebraic characterization of data and timed languages

DOI10.1007/3-540-44685-0_17MaRDI QIDQ4791839zbMATH OpenFDO

Authors Patricia Bouyer, Denis Thérien, A. Petit

Publication date 3 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2154/21540248.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• An algebraic approach to data languages and timed languages
• A logical characterization of timed pushdown languages
• A Machine-Independent Characterization of Timed Languages
• A logical characterization of timed regular languages
• A logical characterization of timed (non-)regular languages
• Algebraic and logical characterizations of deterministic linear time classes
• scientific article; zbMATH DE number 860052
• Towards an algebra for timed behaviours
• Developments in Language Theory
• Abstract implementation of algebraic specifications in a temporal logic language

Cited in

(15)

• An algebraic approach to data languages and timed languages
• Weighted register automata and weighted logic on data words
• A logical characterization of data languages.
• Equational theories for automata
• Deterministic regular expressions with back-references
• Balanced timed regular expressions
• A Machine-Independent Characterization of Timed Languages
• Weighted register automata and weighted logic on data words
• On timed regular languages defined by inverse monoid morphisms
• Counting Multiplicity over Infinite Alphabets
• Algebraic and logical characterizations of deterministic linear time classes
• Mathematical Foundations of Computer Science 2004
• Extending two-variable logic on data trees with order on data values and its automata
• Active learning of deterministic timed automata with Myhill-Nerode style characterization
• Recognizing number

This page was built for publication: An algebraic characterization of data and timed languages

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