Recognizable complex trace languages. (Abstract)

DOI10.1007/3-540-54345-7_56MaRDI QIDQ4035234zbMATH OpenFDO

Authors Volker Diekert, Paul Gastin, A. Petit

Publication date 18 May 1993

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

Full work available at URL https://doi.org/10.1007/3-540-54345-7_56

zbMATH Keywords

closure propertiesconcurrent iterationrecognizable languagestrace languages

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45)

Recommendations

• Rational and recognizable complex trace languages
• Subclasses of recognizable trace languages
• Recognizable and rational languages of finite and infinite traces
• scientific article; zbMATH DE number 2143013
• A Kleene theorem for infinite trace languages

Cited in

(13)

• An extension of Kleene's and Ochmański's theorems to infinite traces
• Recognizable trace languages, distributed automata and the distribution problem
• Rational and recognizable complex trace languages
• The word problem for \(1\mathcal{LC}\) congruences is NP-hard.
• Classifying invariant structures of step traces
• scientific article; zbMATH DE number 3870628 (Why is no real title available?)
• Recognizable and rational languages of finite and infinite traces
• scientific article; zbMATH DE number 2143013 (Why is no real title available?)
• Subclasses of recognizable trace languages
• Poset properties of complex traces
• Asynchronous cellular automata for infinite traces
• Step traces
• On the concatenation of infinite traces

This page was built for publication: Recognizable complex trace languages. (Abstract)

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