Work

The inclusion problem for monadic recursion schemes

Year: 1973

Type: article

Abstract: The inclusion problem for the class of monadic recursion schemes is shown to be undecidable. The proof illustrates the close relationship between monadic recursion schemes and deterministic pushdown automata. The proof is extended to show that both the weak equivalence problem for the class of monadic recursion schemes and the weak equivalence problem for the class of free schemes without identity are undecidable.

Source: NASA STI Repository (National Aeronautics and Space Administration)

Author: Emily P. Friedman

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W654174064

FWCI:

Cites: 2

Cited by:

Related to: 10