On the equivalence problem for attribute systems

DOI10.1016/S0019-9958(82)90786-0MaRDI QIDQ3311643zbMATH OpenFDO

Authors Paul Franchi-Zannettacci, Bruno Courcelle

Publication date 1982

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

Full work available at URL https://doi.org/10.1016/S0019-9958(82)90786-0

zbMATH Keywords

decidabilityprimitive recursive schemes with parametersrecursive program schemesstrongly noncircular attribute systems

Mathematics Subject Classification ID

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

Cited in

(10)

• Fundamental properties of infinite trees
• Composition and evaluation of attribute coupled grammars
• Attribute grammars and recursive program schemes. I. II
• Decision problems of tree transducers with origin
• A survey on decidable equivalence problems for tree transducers
• 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
• Basic tree transducers
• The equivalence problem for deterministic MSO tree transducers is decidable

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)