Binary distinguishability operation

DOI10.1016/j.tcs.2024.114782MaRDI QIDQ6614021

Matthew Kozma, Cezar Câmpeanu

Publication date: 7 October 2024

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

zbMATH Keywords

automataformal languagesfinite languagesdistinguishability operation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automaticity. I: Properties of a measure of descriptional complexity
• Distinguishability Operations and Closures
• Syntactic Complexity of Ideal and Closed Languages

This page was built for publication: Binary distinguishability operation

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