default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBulletin of the EATCS, Volume 28
Volume 28, February 1986
- Varol Akman, Wm. Randolph Franklin:
On the question "Is Sigma (between 1 and n) root a1 =< L?". Bull. EATCS 28: 16-19 (1986) - R. Boonyavatana, Giora Slutzki:
A generalized Ogden's lema for linear conteext-free languages. Bull. EATCS 28: 20-25 (1986) - Emanuela Fachini, Lorenzo Iania:
A note on the paper "Systolic tree acceptors" by K. Culik II, A. Salomaa and D. Wood. Bull. EATCS 28: 26-29 (1986) - Sándor Horváth:
Finite, simple generating systems for partial recursive functions. Bull. EATCS 28: 30-31 (1986) - Stéphane Kaplan, Marianne Choquer:
On the decidability of quasi-reducibility. Bull. EATCS 28: 32-33 (1986) - John Lawrence:
THe non-existence of finite test sets for set-equivalence of finite substitions. Bull. EATCS 28: 34-36 (1986) - Rani Siromoney, Gift Siromoney:
A public key cryptosystem that defies cryptoanalysis. Bull. EATCS 28: 37-43 (1986) - Bernhard Thalheim:
A responce to the note by M. Y. Vardi. Bull. EATCS 28: 44 (1986)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-08 00:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
