Théorie langage And NotCesare Tinelli
List of bibliographic references
Number of relevant bibliographic references: 11.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000954 | Proof-search in Type-theoretic Languages | |
| 000A74 | R. Kolpakov [Russie] ; G. Kucherov [France] ; Y. Tarannikov [Russie] | On repetition-free binary words of minimal density |
| 000B37 | E. A. Cichon [France] ; E. T. Bittar [France] | Ordinal recursive bounds for Higman's theorem |
| 000B38 | M. Hermann [France] ; G. Salzer [Autriche] | On the word, subsumption, and complement problem for recurrent term schematizations |
| 000B55 | H. Touzet [France] | Encoding the Hydra battle as a rewrite system |
| 000B72 | P.-E. Moreau [France] ; H. Kirchner [France] | A compiler for rewrite programs in associative-commutative theories |
| 000C01 | M. Hermann [France] ; R. Galbavy [France] | Unification of infinite sets of terms schematized by primal grammars |
| 000C08 | A. Bouhoula [États-Unis, France] ; J.-P. Jouannaud [États-Unis, France] ; J. Meseguer [États-Unis] | Specification and proof in membership equational logic |
| 000C22 | R. Kolpakov [Russie] ; G. Kucherov [France] | Minimal letter frequency in n-th power-free binary words |
| 000C71 | G. Kucherov [France] ; Pierre Lescanne [France] ; P. Mosses [Danemark] | Valentin Antimirov (1961-1995) |
| 000D85 | F. Bellegarde ; M. Sintzoff | Rewriting systems on FP expressions to reduce the number of sequences yielded |
| This area was generated with Dilib version V0.6.33. |  |