On Some Closure Properties of nc-eNCE Graph Grammars
Jayakrishna Vijayakumar, Lisa Mathew
TL;DR
This paper investigates specific closure properties of nc-eNCE graph grammars, building on prior research, to deepen understanding of their theoretical capabilities and limitations within automata and grammar theory.
Contribution
It provides new insights into the closure properties of nc-eNCE graph grammars, expanding the theoretical framework established in recent studies.
Findings
Identifies closure properties of nc-eNCE graph grammars
Extends previous work on graph grammar closure properties
Enhances understanding of automata and grammar theory
Abstract
In the study of automata and grammars, closure properties of the associated languages have been studied extensively. In particular, closure properties of various types of graph grammars have been examined in (Rozenberg and Welzl, Inf. and Control,1986) and (Rozenberg and Welzl, Acta Informatica,1986). In this paper we examine some critical closure properties of the nc-eNCE graph grammars discussed in (Jayakrishna and Mathew, Symmetry 2023) and (Jayakrishna and Mathew, ICMICDS 2022).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · semigroups and automata theory · DNA and Biological Computing