Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- An axiomatic approach to the Korenjak-Hopcroft algorithmsTheory of Computing Systems, 1983
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Adherences of languagesJournal of Computer and System Sciences, 1980
- On equivalence of grammars through transformation treesTheoretical Computer Science, 1979
- A representation of trees by languages ITheoretical Computer Science, 1978
- Equivalence problems for deterministic context-free languages and monadic recursion schemesJournal of Computer and System Sciences, 1977
- Completeness results for the equivalence of recursive schemasJournal of Computer and System Sciences, 1976
- Program schemes, recursion schemes, and formal languagesJournal of Computer and System Sciences, 1973
- Deterministic context free languagesInformation and Control, 1966