m by recognizable relations is decidable.">m by recognizable relations is decidable., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"Separability of rational relations in A* × Nm by ..."

Christian Choffrut, Serge Grigorieff (2006)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2005.09.018

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/ChoffrutG06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/ChoffrutG06
Christian Choffrut, Serge Grigorieff:
Separability of rational relations in A* × N^m by recognizable relations is decidable. Inf. Process. Lett. 99(1): 27-32 (2006)

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.