Remarks on the complexity of an invariant of context-free grammars
From MaRDI portal
Publication:1161303
zbMath0478.68077MaRDI QIDQ1161303
Publication date: 1982
Published in: Acta Informatica (Search for Journal in Brave)
membership problem; isomorphism problem; decision problems for finitely presented abelian groups; deterministic polynomial-time
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
Related Items
