Partial commutations and faithful rational transductions

DOI10.1016/0304-3975(84)90053-7MaRDI QIDQ799383zbMATH OpenOpenAlexFDO

Authors Mireille Clerbout, Michel Latteux

Publication date 1984

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(84)90053-7

zbMATH Keywords

BNPconcurrencyfaithful rational transductionsMULTI-RESETpartial commutationquasirealtime languagestrace languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3954296
• Semi-commutations and Partial commutations
• Semi-commutations and rational expressions
• Partial Commutation on Array Languages
• On the usefulness of bifaithful rational cones

Cites work

• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• Combinatorial problems of commutation and rearrangements
• Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
• scientific article; zbMATH DE number 3808972 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3714977 (Why is no real title available?)
• scientific article; zbMATH DE number 3735177 (Why is no real title available?)
• scientific article; zbMATH DE number 3765174 (Why is no real title available?)
• scientific article; zbMATH DE number 3765179 (Why is no real title available?)
• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• scientific article; zbMATH DE number 3592950 (Why is no real title available?)
• Quasi-realtime languages
• Reset machines
• Reversal-Bounded Acceptors and Intersections of Linear Languages
• Sur diverses familles de langages fermées par transduction rationnelle
• The Unsolvability of the Recognition of Linear Context-Free Languages

Cited in

(18)

• Semi-commutations
• Theory of traces
• On the Knuth-Bendix completion for concurrent processes
• Atomic semicommutations
• A partial trace semantics for Petri nets
• Recognizable subsets of some partially Abelian monoids
• A generalization of traces
• scientific article; zbMATH DE number 4211520 (Why is no real title available?)
• On the usefulness of bifaithful rational cones
• Notes on finite asynchronous automata
• Iteration of rational transductions
• The inclusion structure of partially lossy queue monoids and their trace submonoids
• Characterizations of the decidability of some problems for regular trace languages
• On the synchronization of traces
• On confluence of one-rule trace-rewriting systems
• Word problems over traces which are solvable in linear time
• On the concatenation of infinite traces
• Word problems over traces which are solvable in linear time

This page was built for publication: Partial commutations and faithful rational transductions

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