References
- Garey , M.R. and Johnson , D.S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , W. F. Freeman .
- Hopcroft , J.E. and Ullman , J.D. 1979 . Introduction to Automata Theory, Languages, and Computation , Addison-Wesley .
- Hunt , H.B. III . 1979 . Observations on the complexity of regular expression problems . J. Comput. System Sci , 19 : 222 – 236 .
- Kriegel , H.P. and Maurer , H.A. 1976 . Formal translations and Szilard languages . Inform. Control , 30 : 187 – 198 .
- MäKinen , E. On context-free derivations , A Vol. 198 , Tampere : Acta Universitatis Tamperensis .
- Penttonen , M. 1974 . On derivation languages corresponding to context-free grammars . Acta Inform , 3 : 285 – 291 .