Generalized register context-free grammars

DOI10.1007/978-3-030-13435-8_19zbMATH Open1425.68172OpenAlexW2913526914MaRDI QIDQ2278281FDOQ2278281

Authors: Ryoma Senda, Yoshiaki Takata, Hiroyuki Seki 

Publication date: 4 December 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-13435-8_19

Recommendations

• Complexity results on register context-free grammars and register tree automata
• scientific article; zbMATH DE number 2150284
• On multiple context-free grammars
• Normal form algorithms for extended context-free grammars
• scientific article; zbMATH DE number 3965454

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (6)

• Reactive synthesis from visibly register pushdown automata
• Title not available (Why is that?)
• Optimal run problem for weighted register automata
• Complexity results on register context-free grammars and related formalisms
• Automata and grammars for data words
• COMAR: a Data Format for Integration of CFG Tools

This page was built for publication: Generalized register context-free grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278281)