@inproceedings{10.1007/978-3-030-13435-8_19,
    Abstract = {Register context-free grammars (RCFG) is an extension of context-free grammars to handle data values in a restricted way. This paper first introduces register type as a finite representation of the register contents and shows some properties of RCFG. Next, generalized RCFG (GRCFG) is defined by permitting an arbitrary relation on data values in the guard expression of a production rule. We extend register type to GRCFG and introduce two properties of GRCFG, the simulation property and the type oracle. We then show that {\$}{\$}{\backslash}varepsilon {\$}{\$}-rule removal is possible and the emptiness and membership problems are EXPTIME solvable for GRCFG that satisfy these two properties.},
    Address = {Cham},
    Author = {Senda, Ryoma and Takata, Yoshiaki and Seki, Hiroyuki},
    BookTitle = {Language and Automata Theory and Applications},
    Editor = {Mart{\'\i}n-Vide, Carlos and Okhotin, Alexander and Shapira, Dana},
    File = {Senda2019\_Chapter\_GeneralizedRegisterContext-Fre (0) - a - a - e.pdf},
    ISBN = {978-3-030-13435-8},
    Pages = {259--271},
    Publisher = {Springer International Publishing},
    Title = {Generalized Register Context-Free Grammars},
    Year = {2019},
    date-added = {2019-03-19 14:18:26 +0100},
    date-modified = {2019-03-19 14:18:26 +0100},
    doi = {10.1007/978-3-030-13435-8_19}
}

@inproceedings{10.1007/978-3-030-13435-8_19, Abstract = {Register context-free grammars (RCFG) is an extension of context-free grammars to handle data values in a restricted way. This paper first introduces register type as a finite representation of the register contents and shows some properties of RCFG. Next, generalized RCFG (GRCFG) is defined by permitting an arbitrary relation on data values in the guard expression of a production rule. We extend register type to GRCFG and introduce two properties of GRCFG, the simulation property and the type oracle. We then show that {\$}{\$}{\backslash}varepsilon {\$}{\$}-rule removal is possible and the emptiness and membership problems are EXPTIME solvable for GRCFG that satisfy these two properties.}, Address = {Cham}, Author = {Senda, Ryoma and Takata, Yoshiaki and Seki, Hiroyuki}, BookTitle = {Language and Automata Theory and Applications}, Editor = {Mart{\'\i}n-Vide, Carlos and Okhotin, Alexander and Shapira, Dana}, File = {Senda2019_Chapter_GeneralizedRegisterContext-Fre (0) - a - a - e.pdf}, ISBN = {978-3-030-13435-8}, Pages = {259--271}, Publisher = {Springer International Publishing}, Title = {Generalized Register Context-Free Grammars}, Year = {2019}, date-added = {2019-03-19 14:18:26 +0100}, date-modified = {2019-03-19 14:18:26 +0100}, doi = {10.1007/978-3-030-13435-8_19} }