Book · 1994

Computability, Complexity, and Languages

Elsevier BV · Published 1 January 1994 · DOI 10.1016/c2009-0-21176-7

View at the publisherCite this paper

In brief

“Computability, Complexity, and Languages” is a 1994 book. OpenAlex counts 102 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
102
Most cited in
2020 (19)
Field-weighted impact
0.60

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Computability, Complexity, and Languages. (1994). Computability, Complexity, and Languages. Elsevier BV. https://doi.org/10.1016/c2009-0-21176-7

MLA 9

Computability, Complexity, and Languages. Elsevier BV, 1994. https://doi.org/10.1016/c2009-0-21176-7.

Chicago

1994. Computability, Complexity, and Languages. Elsevier BV. https://doi.org/10.1016/c2009-0-21176-7.

Harvard

(1994) Computability, Complexity, and Languages. Elsevier BV. doi:10.1016/c2009-0-21176-7.

IEEE

Computability, Complexity, and Languages. Elsevier BV, 1994, doi: 10.1016/c2009-0-21176-7.

BibTeX

@book{anon1994computability,
  title     = {{Computability, Complexity, and Languages}},
  publisher = {Elsevier BV},
  year      = {1994},
  doi       = {10.1016/c2009-0-21176-7},
  url       = {https://doi.org/10.1016/c2009-0-21176-7}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
20121010
201333
201422
201822
20201919
202111
20221818
202311
20241515

Its field-weighted citation impact is 0.60: it has been cited 0.60 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory

  • computability
  • computational complexity
  • formal languages
  • Turing machines
  • decidability
  • NP-completeness

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Computability, Complexity, and Languages. (1994). Computability, Complexity, and Languages. Elsevier BV. https://doi.org/10.1016/c2009-0-21176-7

How many times has this paper been cited?

102 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

What is the DOI of this paper?

10.1016/c2009-0-21176-7. The permanent link is https://doi.org/10.1016/c2009-0-21176-7.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.