Word Matrix Rewriting Systems

DOI10.3233/FI-2019-1800MaRDI QIDQ5223196zbMATH OpenWikidataFDO

Authors Raj Kishor Bisht, Taishin Yasunobu Nishida, Kouhei Yamamoto

Publication date 17 July 2019

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2019-1800

zbMATH Keywords

context-free languagesParikh vectorregular languagesrestricted parallel rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Parikh matrices and Parikh rewriting systems
• scientific article; zbMATH DE number 1512609
• Rewriting systems over nested data words
• Termination of String Rewriting with Matrix Interpretations
• Regularity and context-freeness over word rewriting systems
• Bottom-up rewriting for words and terms
• scientific article; zbMATH DE number 789389
• On a matrix representation of recursive schemes for word generation
• scientific article; zbMATH DE number 1368955
• scientific article; zbMATH DE number 1254101

Cited in

(1)

• GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA

This page was built for publication: Word Matrix Rewriting Systems

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