Raimonds Simanovskis

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Kalvis Apsitis

> Home > Persons > Raimonds Simanovskis

Publications

2001
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/ApsitisFSS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ApsitisFSS01
Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs:
Closedness properties in ex-identification. Theor. Comput. Sci. 268(2): 367-393 (2001)
1998
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/alt/ApsitisFSS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alt/ApsitisFSS98
Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs:
Closedness Properties in EX-Identification of Recursive Functions. ALT 1998: 46-60
1996
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/icgi/ApsitisFSS96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icgi/ApsitisFSS96
Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs:
Unions of identifiable families of languages. ICGI 1996: 48-58
1992
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/aii/ApsitisFKSS92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aii/ApsitisFKSS92
Kalvis Apsitis, Rusins Freivalds, Martins Krikis, Raimonds Simanovskis, Juris Smotrovs:
Unions of Identifiable Classes of Total Recursive Functions. AII 1992: 99-107

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.