Complete subgraphs of bipartite graphs and applications to trace languages

DOI10.1051/ITA/1990240404091zbMATH Open0701.68063OpenAlexW108494957MaRDI QIDQ3479529FDOQ3479529

Authors: Sergio Salemi, Giovanna Guaiana, Antonio Restivo 

Publication date: 1990

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92365

Recommendations

• Membership problems for regular and context-free trace languages
• Combinatorics on traces
• Publication:4730801
• On the structure of recognizable languages of dependence graphs
• ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS

zbMATH Keywords

concurrencytrace languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Recognizable subsets of some partially Abelian monoids
• Combinatorial problems of commutation and rearrangements
• Title not available (Why is that?)
• On regular trace languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Trace languages defined by regular string languages

This page was built for publication: Complete subgraphs of bipartite graphs and applications to trace languages

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