Acta Endosc < Acta Informatica < Acta Math.

Facettes : Author.f AffOrg.f AffPays.f AffRegion.f AffVille.f Teeft.f

List of bibliographic references

Number of relevant bibliographic references: 22.
[0-20] [0 - 20][0 - 22][20-21][20-40]

Ident.	Authors (with country if any)	Title
000369 (2012)	Pierre Lescanne [France] ; Matthieu Perrinel [France]	“Backward” coinduction, Nash equilibrium and the rationality of escalation
000646 (2011)	Sándor Vágvölgyi [Hongrie]	CHAP and rewrite components
001273 (2006)	Wim Janssen [Belgique] ; Alexandr Korlyukov [Biélorussie] ; Jan Van Den Bussche [Belgique]	On the tree-transformation power of XSLT
001A08 (2003)	W. Reisig [États-Unis]	On Gurevich's theorem on sequential algorithms
001E61 (2001)	Laurent Alonso ; René Schott	On the tree inclusion problem
002769 (1997)	Zoltán Fülöp ; Sándor Vágvölgyi	Minimal equational representations of recognizable tree languages
002A99 (1995)	Wlodzimierz Drabent [Pologne, Suède]	What is failure? An approach to constructive negation
002B90 (1995)	X. J. Chen [Italie] ; C. Montangero [Italie]	Compositional refinements in multiple blackboard systems
002E22 (1993)	Eddy Bevers [Belgique] ; Johan Lewi [Belgique]	Proving termination of (conditional) rewrite systems
002E30 (1993)	Thomas Lehmann [Allemagne] ; Jacques Loeckx [Allemagne]	OBSCURE a specification language for abstract data types
002E55 (1993)	Marisa Navarro [Espagne] ; Fernando Orejas [Espagne] ; Jean-Luc Remy [France]	Contextual rewriting as a sound and complete proof method for conditional LOG-specifications
003023 (1992)	Joost Engelfriet [Pays-Bas] ; Linda Heyker [Pays-Bas]	Context-free hypergraph grammars have the same term-generating power as attribute grammars
003257 (1990)	Jeremy Dick [Royaume-Uni] ; John Kalmus [Royaume-Uni] ; Ursula Martin [Royaume-Uni]	Automating the Knuth Bendix ordering
003438 (1988)	William P. R. Mitchell [Royaume-Uni]	Inductive completion with retracts
003445 (1988)	Paliath Narendran [États-Unis] ; Friedrich Otto [États-Unis]	Elements of finite order for finite weight-reducing and confluent thue systems
003462 (1988)		Acknowledgement to referees
003536 (1987)	Deepak Kapur [États-Unis] ; Paliath Narendran [États-Unis] ; Hantao Zhang [États-Unis]	On sufficient-completeness and related properties of term rewriting systems
003563 (1987)		Acknowledgement to referees
003642 (1986)		Acknowledgement to referees
003821 (1983)	Herman Akdag [France]	Performances of an algorithm constructing a nearly optimal binary tree
003823 (1983)	Martin Wirsing [Allemagne] ; Peter Pepper [Allemagne] ; Helmut Partsch [Allemagne] ; Walter Dosch [Allemagne] ; Manfred Broy [Allemagne]	On hierarchies of abstract data types

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/ISSN.i -k "Acta Informatica" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/ISSN.i  \
                -Sk "Acta Informatica" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd 

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Checkpoint
   |type=    indexItem
   |index=    ISSN.i
   |clé=    Acta Informatica
}}

---

This area was generated with Dilib version V0.6.33. Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022