On the equivalence problem for attribute systems

DOI10.1016/S0019-9958(82)90786-0zbMATH Open0529.68005MaRDI QIDQ3311643FDOQ3311643

Authors: Paul Franchi-Zannettacci, Bruno Courcelle 

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

decidabilityrecursive program schemesprimitive recursive schemes with parametersstrongly noncircular attribute systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (10)

• Composition and evaluation of attribute coupled grammars
• Basic tree transducers
• Decision problems of tree transducers with origin
• The equivalence problem for deterministic MSO tree transducers is decidable
• Fundamental properties of infinite trees
• Attribute grammars and recursive program schemes. I. II
• Earliest normal form and minimization for bottom-up tree transducers
• An axiomatic approach to the Korenjak-Hopcroft algorithms
• Iterated linear control and iterated one-turn pushdowns
• A survey on decidable equivalence problems for tree transducers

This page was built for publication: On the equivalence problem for attribute systems

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