Papers/Europipe'83 Conference, Basle, 20-22 June 1983Europipe '83. 1983, 168 p.Conference Proceedings

Baritovye mestorozhdeniya SSSR i ikh genezisDELITSIN, I. S.Izvestiâ Akademii nauk SSSR. Seriâ geologičeskaâ. 1983, Num 12, pp 130-134, issn 0321-1703Article

Effect of surface treatments on fatigue life of Ti-6-22-22 alloy at room and high temperaturesYU, Z. L; LI, S. X; LIU, Y. Y et al.Materials science & engineering. A, Structural materials : properties, microstructure and processing. 2004, Vol 383, Num 2, pp 283-288, issn 0921-5093, 6 p.Article

A conversion-electron investigation of the 9.4 keV M1+E2 transition in 83KrKOVALIK, A; GOROZHANKIN, V. M.Journal of physics. G. Nuclear and particle physics (Print). 1993, Vol 19, Num 11, pp 1921-1927, issn 0954-3899Article

Self-embbeding indexed grammarsPARCHMANN, R; DUSKE, J.Theoretical computer science. 1986, Vol 47, Num 2, pp 219-223, issn 0304-3975Article

WELDEX 83 ― Guide to the exhibition = WELDEX 83 ― Guide des produits exposésWelding and metal fabrication. 1983, Vol 51, Num 7, pp 322-323, issn 0043-2245Article

Inferring subclasses of contextual languagesEMERALD, J. D; SUBRAMANIAN, K. G; THOMAS, D. G et al.Lecture notes in computer science. 2000, pp 65-74, issn 0302-9743, isbn 3-540-41011-2Conference Paper

Sublinear ambiguityWICH, K.Lecture notes in computer science. 2000, pp 690-698, issn 0302-9743, isbn 3-540-67901-4Conference Paper

XML grammarsBERSTEL, J; BOASSON, L.Lecture notes in computer science. 2000, pp 182-191, issn 0302-9743, isbn 3-540-67901-4Conference Paper

Prefixes of infinite words and ambiguous context-free languagesAUTEBERT, J.-M; FLAJOLET, P; GABARRO, J et al.Information processing letters. 1987, Vol 25, Num 4, pp 211-216, issn 0020-0190Article

Context-free text grammarsEHRENFEUCHT, A; TEN PAS, P; ROZENBERG, G et al.Acta informatica. 1994, Vol 31, Num 2, pp 161-206, issn 0001-5903Article

Universal inherence of cycle-free context-free ambiguity functionsWICH, Klaus.Lecture notes in computer science. 2002, pp 669-680, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

A NEW DETERMINATION OF THE HALF-LIFE OF ⁸³RBBROWN LC.1972; J. INORG. NUCL. CHEM.; G.B.; DA. 1972; VOL. 24; NO 9; PP. 2974-2978; BIBL. 8 REF.Serial Issue

Every iterated morphism yields a co-CFLBERSTEL, J.Information processing letters. 1986, Vol 22, Num 1, pp 7-9, issn 0020-0190Article

INTERPRETATION OF MOESSBAUER FRACTIONS OF ⁸³KR 9.3 KEV TRANSITION BY INELASTIC NEUTRON SCATTERINGGUPTA NP.1972; LETTERE NUOVO CIMENTO; ITAL.; DA. 1972; VOL. 3; NO 14; PP. 599-600; BIBL. 11 REF.Serial Issue

Density-Independent Contributions to Longitudinal Relaxation in ⁸³KrCLEVELAND, Zackary I; MEERSMANN, Thomas.ChemPhysChem (Print). 2008, Vol 9, Num 10, pp 1375-1379, issn 1439-4235, 5 p.Article

Comparing computational representations of Herbrand modelsMATZINGER, R.Lecture notes in computer science. 1997, pp 203-218, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Bidirectional context-free grammar parsing for natural language processingSATTA, G; STOCK, O.Artificial intelligence. 1994, Vol 69, Num 1-2, pp 123-164, issn 0004-3702Article

Context-free languages over infinite alphabetsCHENG, E. Y. C; KAMINSKI, M.Acta informatica. 1998, Vol 35, Num 3, pp 245-267, issn 0001-5903Article

Context-free graph languages of bounded degree are generated by apex graph grammarsENGELFRIET, J; HEYKER, L; LEIH, G et al.Acta informatica. 1994, Vol 31, Num 4, pp 341-378, issn 0001-5903Article

Time varying pushdown automataKAMALA KRITHIVASAN; SRINIVASAN, V.International journal of computer mathematics. 1988, Vol 24, Num 3-4, pp 223-236, issn 0020-7160Article

Grammatical inference : algorithms and applications (Lisbon, 11-13 September 2000)Oliveira, Arlindo L.Lecture notes in computer science. 2000, issn 0302-9743, isbn 3-540-41011-2, VIII, 311 p, isbn 3-540-41011-2Conference Proceedings

Strong iteration lemmata for regular, linear, context-free, and linear indexed languagesDÖMÖSI, P; KUDLEK, M.Lecture notes in computer science. 1999, pp 226-233, issn 0302-9743, isbn 3-540-66412-2Conference Paper

Cancellation in context-free languages: enrichment by reductionJANTZEN, M; PETERSEN, H.Theoretical computer science. 1994, Vol 127, Num 1, pp 149-170, issn 0304-3975Article

Undecidable equivalences for basic process algebraGROOTE, J. F; HÜTTEL, H.Information and computation (Print). 1994, Vol 115, Num 2, pp 354-371, issn 0890-5401Article