Uniform rewriting based on permutations

DOI10.1080/00207169808804709MaRDI QIDQ4208597zbMATH OpenOpenAlexFDO

Authors Alexander Meduna

Publication date 7 September 1998

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169808804709

zbMATH Keywords

EIL systemsphrase-structure grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Permutative rewriting and unification
• Permutation rewriting and algorithmic verification
• Perpetuality and uniform normalization in orthogonal rewrite systems
• A recursive construction of t-wise uniform permutations
• Axiomatizing permutation equivalence
• Combinatorial rewriting on traces
• scientific article; zbMATH DE number 4205990
• ON A HIERARCHY OF PERMUTATION LANGUAGES
• General algorithms for permutations in equational inference

Cites work

• Context free derivations on word monoids
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• Syntactic complexity of context-free grammars over word monoids
• Tree controlled grammars

Cited in

(3)

• Homogeneous grammars with a reduced number of non-context-free products
• ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS
• ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS

This page was built for publication: Uniform rewriting based on permutations

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