gross < ground < grounding

Facettes : Author.f AffPays.f AffRegion.f AffVille.f AffOrg.f KwdFr.f Mesh.f MeshFr.f Teeft.f

List of bibliographic references indexed by ground

Number of relevant bibliographic references: 54.
[20-40] [0 - 20][0 - 50][40-53][40-60]

Ident.	Authors (with country if any)	Title
00A814 (1999)	Hubert Comon ; Florent Jacquemard	Ground Reducibility is EXPTIME-complete
00A905 (1999)	Jerzy Marcinkowski [Pologne]	Undecidability of the $$\exists ^ * \forall ^ * $$Part of the Theory of Ground Term Algebra Modulo an AC Symbol
00AA13 (1999)	Joost Engelfriet [Pays-Bas]	Derivation Trees of Ground Term Rewriting Systems
00AC32 (1999)	Adel Bouhoula [France]	Simultaneous Checking of Completeness and Ground Confluence
00AC96 (1999)	Hubert Comon ; Florent Jacquemard [France]	Ground Reducibility is EXPTIME-complete
00AD67 (1999)	Adel Bouhoula [France]	A New Procedure for Simultaneously Checking Completeness and Ground Confluence
00B594 (1998)	Richard Mayr [France] ; Michaël Rusinowitch	Reachability is decidable for ground AC Rewrite systems
00BC82 (1997)	Deepak Kapur [États-Unis] ; G. Sivakumar [Inde]	A total, ground path ordering for proving termination of AC-rewrite systems
00C093 (1996)	Paliath Narendran [États-Unis] ; Michaël Rusinowitch [France]	Any ground associative-commutative theory has a finite canonical system
00C407 (1995)	G. Kucherov ; M. Rusinowitch	Complexity of testing ground reducibility for linear word rewriting systems with variables
00C459 (1995)	G. Kucherov ; M. Rusinowitch	Undecidability of Ground Reducibility for Word Rewriting Systems with Variables
00C495 (1995)	G. Kucherov ; M. Tajine	Decidability of Regularity and Related Properties of Ground Normal Form Languages
00C692 (1995)	Gregory Kucherov [France] ; Michaël Rusinowitch [France]	The complexity of testing ground reducibility for linear word rewriting systems with variables
00C766 (1995)	G. Kucherov [France] ; M. Tajine [France]	Decidability of Regularity and Related Properties of Ground Normal Form Languages
00C795 (1995)	P. De Reffye [France] ; F. Houllier [France] ; F. Blaise [France] ; D. Barthelemy [France] ; J. Dauzat [France] ; D. Auclair [France]	A model simulating above- and below-ground tree architecture with agroforestry applications
00CA74 (1994)	G. Kucherov ; M. Rusinowitch	The Complexity of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables
00CB43 (1994)	G. Kucherov ; M. Rusinowitch	On Ground-Reducibility Problem for Word Rewriting Systems with Variables
00D045 (1993)	P. Narendran ; M. Rusinowitch	The Unifiability Problem in Ground AC Theories
00D203 (1993)	Gregory Kucherov [France] ; Mohamed Tajine [France]	Decidability of regularity and related properties of ground normal form languages
00D477 (1992)	G. Kucherov ; M. Tajine	Decidability of Regularity and Related Properties of Ground Normal Form Languages
00D860 (1991)	P. Narendran ; M. Rusinowitch	Any Ground Associative-commutative Theory has a Finite Canonical System

---

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i -k "ground" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Title.i  \
                -Sk "ground" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Title.i
   |clé=    ground
}}

---

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