scientific article; zbMATH DE number 3883629

From MaRDI portal
Publication:3217620





[For the entire collection see Zbl 0542.00016.] Motivated by the idea of describing parquet deformations using grammars, we define in this paper a terminal weighted grammar where the terminal generated at any step of a derivation is defined as a function of time. It is seen that terminal weighted regular grammars generate exactly the class of recursively enumerable sets. Terminal weighted matrix grammars are used to describe parquet deformations. The hierarchy of families generated by putting various restrictions on the functions is studied.











This page was built for publication:

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