On Concatenative Decompositions of Regular Events

DOI10.1109/TC.1968.229096zbMATH Open0155.34404OpenAlexW2162897462MaRDI QIDQ5536640FDOQ5536640

Authors: Azaria Paz, Bezalel Peleg 

Publication date: 1968

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1968.229096

zbMATH Keywords

mathematical logic

Cited In (5)

• A non-ambiguous decomposition of regular languages and factorizing codes
• Minimal Union-Free Decompositions of Regular Languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the undecidability and descriptional complexity of synchronized regular expressions

This page was built for publication: On Concatenative Decompositions of Regular Events

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