The membership problem for unordered vector languages

zbMATH Open1096.68631MaRDI QIDQ5485983FDOQ5485983

Authors: Giorgio Satta 

Publication date: 6 September 2006

Recommendations

• Publication:4734777
• scientific article; zbMATH DE number 3852433
• On the membership problem of permutation grammars -- a direct proof of NP-completeness
• The membership problem for linear and regular permutation languages
• The membership problem for regular expressions with unordered concatenation and numerical constraints

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)

Cited In (1)

• Sequential grammars and automata with valences

This page was built for publication: The membership problem for unordered vector languages

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