T. Pavlidis
- 1 MILLER, W. F., AND SHAW, A. C. Linguistic methods in picture processing--a survey. Proc. FJCC, Vol. ~ (1968), pp. 279-290.Google Scholar
- 2 PFALTZ, J. L., AND ROSENFELD, A. Web grammars. Proc. Joint Intern. Conf. on Artificial Intelligence, Washington, D. C., May 1969.Google Scholar
- 3 SHAW, A.C. Parsing of graph-representable pictures. J.ACM 17 (July 1970), 453-481. Google ScholarDigital Library
- 4 MONTANARI, U.G. Separable graphs, planar graphs and web grammars. Inform. Cont. 16 (May 1970), 243-267.Google ScholarCross Ref
- 5 PFALTZ, J. L. Web grammars and picture description. Tech. Rep. 79-138, Comp. Sci. Center, U. of Maryland, Sept. 1970.Google Scholar
- 6 Fu, KING-SuN, AND SWAIN, P .H . OR syntactic pattern recognition. In Software Engineering, Vol. 2 (J. Tou, Ed.), Academic Press, New York, 1971, pp. 155-182.Google Scholar
- 7 ROSENFELD, A., AND STRONG, J .P . A grammar for maps. In Software Engineering, Vol. 2 (J. Tou, Ed.), Academic Press, New York, 1971, pp. 227-239.Google Scholar
- 8 SHAW, A.C. Picture graphs, grammars and parsing. Tech. Rep. No. 71-89, Dep. of Comp. Sci., Cornell U., Jan. 1971 (presented at the International Conference on Frontiers of Pattern Recognition, Honolulu, Hawaii, Jan. 1971).Google Scholar
- 9 PAVLIDIS, T. Structural pattern recognition: Primitives and juxtaposition relations. Tech. Report No. 89, Comp. Sci. Lab., Princeton U., Jan. 1971 (presented at the International Conference on Frontiers of Pattern Recognition, Honolulu, Hawaii, Jan. 1971).Google Scholar
- 10 FEDEa, J. Plex languages. Inform. Set. 8 (1971), 225-241.Google Scholar
- 11 ROSENFELD, A. Isotonic grammars, parallel grammars and picture grammars. In Machine Intelligence, Vol. 6, 1971. Edinburgh U. Press, Edinburgh, 1971, pp. 281-294.Google Scholar
- 12 ROUNDS, W. C. Context-free grammars on trees. Conf. Rec. ACM Syrup. on Theory of Computing. ACM, New York, 1969, pp. 143-148. Google ScholarCross Ref
- 13 THATCHER, J. W. There's a lot more to finite automata theory than you would have thought. Proc. ~th Annual Princeton Conference, March 1970, pp. 263-276.Google Scholar
- 14 HARARY, F. Graph Theory. Addison-Wesley, Reading, Mass., 1969.Google Scholar
- 15 HOPCROFT, J. E ., AND ULLMAN, J. D. Formal Languages and Their Relation to Automata. Addison-Wesley, Reading, Mass., 1969. Google ScholarDigital Library
- 16 BLUM, M., AND HEWITT, C. Automata on a two-dimensional tape. Proc. 8th IEEE Conference on Switching and Automata Theory, 1968, pp. 155-160.Google Scholar
- 17 MINSKY, M., AND PAPERT, S. Perceptrons. M.I.T. Press, Cambridge, Mass., 1969.Google Scholar
- 18 MYLOPOULOS, J. On the definition and recognition of patterns in discrete spaces. Tech. Rep. No. 84, Comp. Sci. Lab., Princeton U., Aug. 1970.Google Scholar
- 19 MILGRAM, D. L., AND ROSENFELD, A. Array automata and array grammars. Tech. Rep. No. 70-141, Comp. Set. Center, U. of Maryland, Nov. 1970.Google Scholar
Index Terms
- Linear and Context-Free Graph Grammars
Recommendations
Lexicalized context-free grammars
ACL '93: Proceedings of the 31st annual meeting on Association for Computational LinguisticsLexicalized context-free grammar(LCFG) is an attractive compromise between the parsing efficiency of context-free grammar (CFG) and the elegance and lexical sensitivity of lexicalized tree adjoining grammar (LTAG). LCFG is a restricted form of LTAG that ...
LR(k)-parsing of Coupled-Context-Free Grammars
COLING '94: Proceedings of the 15th conference on Computational linguistics - Volume 1Coupled-Context-Free Grammars are a generalization of context-free grammars obtained by combining nonterminals to parentheses which can only be substituted simultaneously. Referring to the generative capacity of the grammars we obtain an infinite ...
Ordered Context-Free Grammars
Implementation and Application of AutomataAbstractWe propose a new unambiguous grammar formalism, referred to as ordered context-free grammars, which is identical to context-free grammars, apart from the property that it also places an order on parse trees. Since only a minor modification to ...
Comments