Derivatives and quotients of prefix-free context-free languages
From MaRDI portal
Publication:3901017
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Thue and Post systems, etc. (03D03) Recursively (computably) enumerable sets and degrees (03D25) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35)
This page was built for publication: Derivatives and quotients of prefix-free context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3901017)