论文信息 - On the Complexity of Decision Problems for Classes of Simple Programs on Strings - 字舞流文

On the Complexity of Decision Problems for Classes of Simple Programs on Strings

1. Motivation and relation to other work 2. Definitions and basic properties 3. Classes of simple programs on strings 4. Decidability properties for simple programs on strings 5. An undecidability result 6. References

Giorgio Ausiello | Marina Moscarini

[1] Dennis Tsichritzis,et al. The Equivalence Problem of Simple Programs , 1970, JACM.

[2] A. Grzegorczyk. Some classes of recursive functions , 1964 .

[3] Klaus Weihrauch,et al. Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata , 1972, ICALP.

[4] Giorgio Ausiello. Simple Programs on Strings and Their Decision Problems , 1975 .

[5] Sartaj Sahni,et al. On the Computational Complexity of Scheme Equivalence , 1974 .

[6] Stephen A. Cook,et al. Feasibly constructive proofs and the propositional calculus (Preliminary Version) , 1975, STOC.

[7] Albert R. Meyer,et al. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[8] Neil D. Jones,et al. Even simple programs are hard to analyze , 1977, POPL '75.