Results 331 to 340 of about 459,830 (368)
Some of the next articles are maybe not open access.
Context-free grammars on trees
Proceedings of the first annual ACM symposium on Theory of computing - STOC '69, 1969In this paper we discuss still another version of indexed grammars 1 and macro grammars3,gaining some geometric intuition about the structure of these systems. An ordinary context-free grammar is a rewriting system for strings; we find that a macro grammar is a rewriting system for trees.
openaire +1 more source
Finding Arabic Poem Meter using Context Free Grammar
, 2013Mohammad Awwad Alnagdawi
semanticscholar +1 more source
A context free grammar and its predictive parser for bangla grammar recognition
2010 13th International Conference on Computer and Information Technology (ICCIT), 2010K. Hasan, Amit Mondal, Amit Saha
semanticscholar +1 more source
Context free grammar induction library using Genetic Algorithms
International Conference on Computing and Convergence Technology, 2010Hari Mohan Pandey
semanticscholar +1 more source
Hand Gesture Recognition Using Haar-Like Features and a Stochastic Context-Free Grammar
IEEE Transactions on Instrumentation and Measurement, 2008Qing Chen, N. Georganas, E. Petriu
semanticscholar +1 more source
1997
Graph languages are sets of labeled graphs. They can be generated by graph grammars, and in particular by context-free graph grammars. There are several types of context-free graph grammars, depending, e.g., on whether (hyper)edges or nodes are rewritten by graphs. Basic properties of the main types of context-free graph grammars are discussed.
openaire +2 more sources
Graph languages are sets of labeled graphs. They can be generated by graph grammars, and in particular by context-free graph grammars. There are several types of context-free graph grammars, depending, e.g., on whether (hyper)edges or nodes are rewritten by graphs. Basic properties of the main types of context-free graph grammars are discussed.
openaire +2 more sources
Recognition of Equations Using a Two-Dimensional Stochastic Context-Free Grammar
Other Conferences, 1989P. Chou
semanticscholar +1 more source
IEEE Transactions on Evolutionary Computation, 2009
Yoshihiko Hasegawa, H. Iba
semanticscholar +1 more source
Yoshihiko Hasegawa, H. Iba
semanticscholar +1 more source
Large Language Models Demonstrate the Potential of Statistical Learning in Language
Cognitive Science, 2023exaly
Learning context-free grammar rules from a set of program
IET Software, 2008Alpana Dubey, P. Jalote, S. Aggarwal
semanticscholar +1 more source