On the equivalence problem for attribute systems

DOI10.1016/S0019-9958(82)90786-0zbMath0529.68005MaRDI QIDQ3311643

Paul Franchi-Zannettacci

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)

Related Items (10)

An axiomatic approach to the Korenjak-Hopcroft algorithms ⋮ The equivalence problem for deterministic MSO tree transducers is decidable ⋮ Decision problems of tree transducers with origin ⋮ EARLIEST NORMAL FORM AND MINIMIZATION FOR BOTTOM-UP TREE TRANSDUCERS ⋮ Composition and evaluation of attribute coupled grammars ⋮ Iterated linear control and iterated one-turn pushdowns ⋮ Attribute grammars and recursive program schemes. I. II ⋮ Basic tree transducers ⋮ A Survey on Decidable Equivalence Problems for Tree Transducers ⋮ Fundamental properties of infinite trees

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