scientific article; zbMATH DE number 223548

zbMATH Open0796.68132MaRDI QIDQ5286134FDOQ5286134

Authors: Zoltán Fülöp 

Publication date: 29 June 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 475426
• A complete description for a monoid of deterministic bottom-up tree transformation classes
• A complete rewriting system for a monoid of tree transformation classes
• scientific article; zbMATH DE number 475412
• scientific article; zbMATH DE number 1722657
• Mathematical Foundations of Computer Science 2005
• Monodic Tree Kleene Algebra
• Decidability and independence of conjugacy problems in finitely presented monoids
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
• Developments in Language Theory

zbMATH Keywords

monoidsdeterministic bottom-up tree transformation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (5)

• Title not available (Why is that?)
• Over Which Monoids is the Transducer Determinization Procedure Applicable?
• Classes of Tree Homomorphisms with Decidable Preservation of Regularity
• The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations
• A complete rewriting system for a monoid of tree transformation classes

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 Q5286134)