A class of rational trace relations closed under composition

DOI10.4230/LIPICS.FSTTCS.2023.20MaRDI QIDQ6951717zbMATH OpenFDO

Authors Dietrich Kuske

Publication date 28 July 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2023.20

zbMATH Keywords

Mazurkiewicz tracespreservation of rationality and recognizabilityrational relations

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A note on the commutative closure of star-free languages
• Asynchronous cellular automata for pomsets
• Automata Studies. (AM-34)
• Automata-based presentations of infinite structures
• Automatic structures
• Automatic structures: twenty years later
• Combinatorial problems of commutation and rearrangements
• Communicating automata
• Context-Sensitive Languages, Rational Graphs and Determinism
• Elements of automata theory. Translated from the French by Reuben Thomas
• Finite automata
• Formal Models of Communicating Systems
• Forwards- and backwards-reachability for cooperating multi-pushdown systems
• Graph Logics with Rational Relations and the Generalized Intersection Problem
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1512622 (Why is no real title available?)
• scientific article; zbMATH DE number 2087217 (Why is no real title available?)
• scientific article; zbMATH DE number 1834676 (Why is no real title available?)
• Notes on finite asynchronous automata
• On Rational Trees
• On Relations Defined by Generalized Finite Automata
• On the regular structure of prefix rewriting
• Rational equivalence relations
• Reachability analysis of pushdown automata: Application to model-checking
• Recognizable and logically definable languages of infinite computations in concurrent automata
• Symbolic Model Checking of Tense Logics on Rational Kripke Models
• Synchronized rational relations of finite and infinite words
• The subtrace order and counting first-order logic
• Transductions des langages de Chomsky
• Uniformizing rational relations for natural language applications using weighted determinization

Cited in

(1)

• Reachability in trace-pushdown systems

This page was built for publication: A class of rational trace relations closed under composition

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