Chapter 8 – GRAMMARS

In the previous chapters, we have discussed various types of string and array acceptors. This chapter introduces grammars that can be used to either generate or accept (“parse”) sets of strings or arrays. It defines a hierarchy of such grammars, and also establishes equivalences between certain classes of grammars and of acceptors.

[1]  Rani Siromoney,et al.  Parallel Context-Free Languages , 1974, Inf. Control..

[2]  Sven Skyum.  Parallel Context-Free Languages , 1974, Inf. Control..

[3]  Azriel Rosenfeld.  Some Notes on Finite-State Picture Languages , 1976, Inf. Control..

[4]  Rani Siromoney,et al.  Picture Languages with Array Rewriting Rules , 1973, Inf. Control..

[5]  Rani Siromoney,et al.  Array Grammars and Kolam , 1974, Comput. Graph. Image Process..

[6]  Azriel Rosenfeld,et al.  Array Grammar Normal Forms , 1973, Inf. Control..

[7]  John Mylopoulos,et al.  On the application of formal language and automata theory to pattern recognition , 1972, Pattern Recognit..

[8]  Adrian Walker.  Formal Grammars and the Regeneration Capability of Biological Systems , 1975, J. Comput. Syst. Sci..

[9]  Rani Siromoney,et al.  Extended Controlled Table L-Arrays , 1977, Inf. Control..

[10]  Rani Siromoney,et al.  Abstract families of matrices and picture languages , 1972, Comput. Graph. Image Process..