Computing Blocker Sets for the Regular Post Embedding Problem

DOI10.1007/978-3-642-14455-4_14MaRDI QIDQ3584888zbMATH OpenOpenAlexFDO

Authors Pierre Chambart, Philippe Schnoebelen

Publication date 31 August 2010

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14455-4_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• AN ALGORITHM FOR CONSTRUCTING BLOCKING SETS FOR PROJECTIVE PLANES
• On blockers in bounded posets
• scientific article; zbMATH DE number 510064
• scientific article; zbMATH DE number 1594306
• A computer search for minimal blocking sets in PG(2,q).
• Block recursive parallelotopic bounding in set membership identification
• scientific article; zbMATH DE number 3958110
• On the linearity of higher-dimensional blocking sets
• scientific article; zbMATH DE number 3915089
• Blocking sets in \(\mathrm{PG}(r,q^n)\)

This page was built for publication: Computing Blocker Sets for the Regular Post Embedding Problem

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