( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Recursive Applicative Program Schemes

. Handbook of Theoretical Computer Science: Formal Models and Semantics, B, глава 9, MIT Press, Cambridge, MA, USA, (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Armin Bruno

Horst Bruno

Horst Bruno

Eugen Bruno

Axel Brunold

 

Другие публикации лиц с тем же именем

Automata for Monadic Second-Order Model-Checking.. RP, том 6945 из Lecture Notes in Computer Science, стр. 26-27. Springer, (2011)The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic., и . CSL, том 3634 из Lecture Notes in Computer Science, стр. 325-338. Springer, (2005)Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey.. Developments in Language Theory, том 3340 из Lecture Notes in Computer Science, стр. 1-11. Springer, (2004)Program Equivalence and Canonical Forms in Stable Discrete Interpretations., и . ICALP, стр. 168-188. Edinburgh University Press, (1976)Regularity Equals Monadic Second-Order Definability for Quasi-trees.. Fields of Logic and Computation II, том 9300 из Lecture Notes in Computer Science, стр. 129-141. Springer, (2015)An Algebraic Formalism for Graphs., и . CAAP, том 214 из Lecture Notes in Computer Science, стр. 74-84. Springer, (1986)Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations.. FoSSaCS, том 2303 из Lecture Notes in Computer Science, стр. 1-4. Springer, (2002)Graph Operations and Monadic Second-Order Logic: A Survey.. LPAR, том 1955 из Lecture Notes in Computer Science, стр. 20-24. Springer, (2000)Infinite Transducers on Terms Denoting Graphs., и . ELS, стр. 47-58. ELSAA, (2013)Définitions Récursives Par Cas., и . RAIRO Theor. Informatics Appl., 18 (2): 91-129 (1984)