On Decompositions of Regular Events

DOI10.1145/321495.321505MaRDI QIDQ5573395zbMATH OpenOpenAlexWikidataFDO

Authors Janusz Brzozowski, Rina S. Cohen

Publication date 1969

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321495.321505

zbMATH Keywords

recursion theory, constructive mathematics

Cited in

(13)

• A complete refinement procedure for regular separability of context-free languages
• A non-ambiguous decomposition of regular languages and factorizing codes
• Nondeterministic state complexity of star-free languages
• Concatenation-free languages
• Nondeterministic state complexity of star-free languages
• MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
• Co-lexicographically ordering automata and regular languages. I
• A mode of decomposition of regular languages
• Expressive capacity of concatenation freeness
• Subregular expressions with two operations
• Minimal Union-Free Decompositions of Regular Languages
• Determination of finite automata accepting subregular languages
• Various types of comet languages and their application in external contextual grammars

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

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