default search action
Informatique Théorique et Applications, Volume 15
Volume 15, Number 1, 1981
- Patrice Enjalbert:
Systèmes de Déduction pour les Arbres et les Schémas de Programme (II). 3-21 - Marie Demlová, Jirí Demel, Václav Koubek:
On Subdirectly Irreducible Automata. 23-46 - Maurice Tchuenté:
Sur l'Auto- Stabilisation dans un Réseau d'Ordinateurs. 47-66 - A. Ja. Dikovskii:
A Theory of Complexity of Monadic Recursion Schemes. 67-94
Volume 15, Number 2, 1981
- André Arnold:
Sémantique des Processus Communicants. 103-139 - Jeannine Leguy:
Transductions Rationnelles Décroissantes. 141-148 - Howard Straubing:
Relationals Morphisms and Operations on Recognizable Sets. 149-159 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
FPOL Systems Generating Counting Languages. 161-173
Volume 15, Number 3, 1981
- Kurt Mehlhorn:
Arbitrary Weight Changes in Dynamic Trees. 183-211 - Eric Lilin:
Transducteurs Finis d'Arbres et Tests d'Égalité. 213-232 - Andreas Brandstädt:
Closure Properties of Certain Families of Formal Languages with Respect to a Generalization of Cyclic Closure. 233-252 - Gianni Aguzzi:
The Theory of Invertible Algorithms. 253-279
Volume 15, Number 4, 1981
- Hans Daduna:
On the Structure of General Stochastic Automata. 287-302 - Christian Queinnec:
Une Formalisation des Systèmes Conversationnels. 303-336 - Hermann A. Maurer, Arto Salomaa, Derick Wood:
Synchronized EOL Forms Under Uniform Interpretation. 337-353 - Jürgen Avenhaus, Klaus Madlener:
An Algorithm for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation. 335-371 - Jean-Claude Raoult:
Finiteness Results on Rewriting Systems. 373-391
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.