Please use this identifier to cite or link to this item:
Volltext verfügbar? / Dokumentlieferung
doi:10.22028/D291-47771 | Title: | Regular Language Representations in the Constructive Type Theory of Coq |
| Author(s): | Doczkal, Christian Smolka, Gert |
| Language: | English |
| Title: | Journal of Automated Reasoning |
| Volume: | 61 |
| Pages: | 521-553 |
| Publisher/Platform: | Springer Nature |
| Year of Publication: | 2018 |
| Free key words: | Regular languages Two-way automata WS1S Constructive type theory Interactive theorem proving Coq Ssreflect |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Journal Article |
| DOI of the first publication: | 10.1007/s10817-018-9460-x |
| URL of the first publication: | https://doi.org/10.1007/s10817-018-9460-x |
| Link to this record: | urn:nbn:de:bsz:291--ds-477718 hdl:20.500.11880/41776 http://dx.doi.org/10.22028/D291-47771 |
| ISSN: | 1573-0670 0168-7433 |
| Date of registration: | 7-May-2026 |
| Faculty: | MI - Fakultät für Mathematik und Informatik |
| Department: | MI - Informatik |
| Professorship: | MI - Prof. Dr. Gert Smolka |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
There are no files associated with this item.
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.