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 problemisomorphism problemdecision problems for finitely presented abelian groupsdeterministic polynomial-time
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (1)
This page was built for publication: Remarks on the complexity of an invariant of context-free grammars
