You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Chapter title |
Superfiniteness of query answers in deductive databases: An automata-theoretic approach
|
---|---|
Chapter number | 104 |
Book title |
Foundations of Software Technology and Theoretical Computer Science
|
Published by |
Springer, Berlin, Heidelberg, December 1992
|
DOI | 10.1007/3-540-56287-7_104 |
Book ISBNs |
978-3-54-056287-0, 978-3-54-047507-1
|
Authors |
Laks V. S. Lakshmanan, Daniel A. Nonen, Lakshmanan, Laks V. S., Nonen, Daniel A. |