scientific article; zbMATH DE number 176496

MaRDI QIDQ4035660zbMATH OpenFDO

Authors Paul Gastin

Publication date 18 May 1993

zbMATH Keywords

closure propertiesconcurrent systemsrational languagesrecognizable languagessyntactic congruencetraces

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 176133
• Subclasses of recognizable trace languages
• An extension of Kleene's and Ochmański's theorems to infinite traces
• Rational and recognizable complex trace languages
• Asynchronous cellular automata for infinite traces

Cited in

(28)

• An extension of Kleene's and Ochmański's theorems to infinite traces
• Recognizable trace languages, distributed automata and the distribution problem
• Deterministic asynchronous automata for infinite traces
• Rational and recognizable complex trace languages
• On the complementation of asynchronous cellular Büchi automata
• Classifying recognizable infinitary trace languages using word automata
• Agreeing within a few writes
• A note on the logical definability of rational trace languages
• Factor and Subsequence Kernels and Signatures of Rational Languages
• Classifying recognizable infinitary trace languages using word automata
• scientific article; zbMATH DE number 18901 (Why is no real title available?)
• scientific article; zbMATH DE number 176133 (Why is no real title available?)
• scientific article; zbMATH DE number 176739 (Why is no real title available?)
• scientific article; zbMATH DE number 512855 (Why is no real title available?)
• Logical definability on infinite traces
• On the complementation of Büchi asynchronous cellular automata
• scientific article; zbMATH DE number 2143013 (Why is no real title available?)
• Subclasses of recognizable trace languages
• Toward a Structure Theory of Regular Infinitary Trace Languages
• Asynchronous cellular automata for infinite traces
• LAZARD'S ELIMINATION (IN TRACES) IS FINITE-STATE RECOGNIZABLE
• scientific article; zbMATH DE number 2187727 (Why is no real title available?)
• Logical definability on infinite traces
• Disjointness, inclusion, and regularity of -rational trace languages (extended abstract)
• On the concatenation of infinite traces
• The poset of infinitary traces
• Bilimites de langages reconnaissables
• On bounded rational trace languages

This page was built for publication:

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