"On the Logical Definability of Topologically Closed Recognizable Languages ..."

David Janin, Giacomo Lenzi (2002)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2022-02-14

- view
  - electronic edition @ cai.sk (open access)
- export record
  dblp key:
  - journals/cai/JaninL02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cai/JaninL02
David Janin, Giacomo Lenzi:
On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees. Comput. Artif. Intell. 21(3): 185-203 (2002)

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.