Myhill-Nerode methods for hypergraphs

DOI10.1007/978-3-642-45030-3_35MaRDI QIDQ6828930zbMATH OpenFDO

Authors René van Bevern, Michael R. Fellows, Serge Gaspers, Frances Rosamond

Publication date 14 January 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45030-3_35

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45)

This page was built for publication: Myhill-Nerode methods for hypergraphs

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