Fundamental properties of infinite trees

Theoretical Computer Science

Volumn 25, Issue 2, 1983, Pages 95-169

  Courcelle, Bruno ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 49049127479     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(83)90059-2     Document Type: Article

References (75)

1. Théorie des magmoïdes
2. Metric interpretations of infinite trees and semantics of non deterministic recursive programs
3. The metric space of infinite trees. Algebraic and topological properties
4. The existence and construction of free iterative theories
5. Solutions of the iteration equation and extensions of the scalar iteration operation
6. Scalar and vector iteration
7. Easy solutions are hard to find
8. Compatible orderings on the metric theory of trees
9. The undecidability of a word problem: on a conjecture of Strong, Maggiolo-Schettini and Rosen
10. Structures de contrôle: définitions opérationnelles et algébriques.
11. On jump-deterministic pushdown automata
12. A representation of trees by languages
13. A representation of trees by languages
14. Frontiers of infinite trees
15. Arbres infinis et systèmes d'équations
16. Infinite trees in normal form and recursive equations having a unique solution
17. On some classes of interpretations
18. Algorithmes d'équivalence et de réduction á des expressions minimales, dam une classe d'équations récursive simples
19. Algebraic families of interpretations
20. The algebraic semantics of recursive program schemes
21. Completions of ordered magmas
22. Completeness results for the equivalence of recursive schemes
23. La programmation en EXEL
24. La programmation en EXEL
25. An algebraic definition for control structures
26. The IO-and OI-hierarchies
27. Higher type recursion and self-application as control structures
28. Monadic computation and iterative algebraic theories
29. Structured programming with and without GOTO statements
30. The algebraic structure of rooted trees
31. IO and OI
32. IO and OI
33. Systèmes de déductions pour les arbres et les schémas de programmes
34. Systèmes de déductions pour les arbres et les schémas de programmes
35. DPDA's in atomic normal form and applications to the equivalence problems
36. Regular trees and the free iterative theory
37. Initial algebra semantics and continuous algebras
38. Explicit definitions and linguistic dominoes
39. Program transformations and algebraic semantics
40. Algebraic Semantics
41. On equivalence of grammars through transformation trees
42. An algorithm for the solution of fixed-point equations for infinite words
43. Résolution d'équations dans les langages d'ordre 1, 2,…ω
44. Confluent reductions abstract properties and applications to term rewriting systems
45. A theorem on resolving equations in the space of languages
46. Bases for chain-complete posets
47. A compactification of the algebra of term
48. On the interpretation of recursive polvadie program schemes
49. Mots infinis engendrés par une grammaire algebrique
50. A formalization of EXEL
51. Computing in Systems Described by Equations
52. The decidability of the equivalence for deterministic stateless pushdown automata
53. The equivalence problem for real-time strict deterministic languages
54. Linear unification
55. A machine-oriented logic based on the resolution principle
56. Tree-manipulating systems and Church-Rosser theorems
57. Program equivalence and context-free grammars
58. On context-free languages and push-down automata
59. Fixed points and algebras with infinitely long expressions
60. Fixed points and algebras with infinitely long expressions
61. On a connection between regular algebras and rational algebraic theories
62. Unique fixed points vs least fixed points
63. The equivalence problem for deterministic finite-turn push-down automata
64. Rational algebraic theories and fixed-point solutions
65. A uniform approach to inductive posets and inductive closure