2023/08/11 by Vijayakumar, Jayakrishna, Mathew, Lisa
#68Q42(Primary) 68Q45 #68R10(SEcondary) #Combinatorics (math.CO) #F.1.1 #F.4.2 #F.4.3 #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #G.2.2
paper · doi:10.48550/arxiv.2308.05943
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).