The expressive power of one variable used once: The chomsky hierarchy and first-order monadic constructor rewriting

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Documents

We study the implicit computational complexity of constructor term rewriting systems where every function and constructor symbol is unary or nullary. Surprisingly, adding simple and natural constraints to rule formation yields classes of systems that accept exactly the four classes of languages in the Chomsky hierarchy.

Original languageEnglish
Title of host publication6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021
EditorsNaoki Kobayashi
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Publication date2021
Article number5
ISBN (Electronic)9783959771917
DOIs
Publication statusPublished - 2021
Event6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021 - Virtual, Buenos Aires, Argentina
Duration: 17 Jul 202124 Jul 2021

Conference

Conference6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021
LandArgentina
ByVirtual, Buenos Aires
Periode17/07/202124/07/2021
SeriesLeibniz International Proceedings in Informatics, LIPIcs
Volume195
ISSN1868-8969

Bibliographical note

Publisher Copyright:
© 2021 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

    Research areas

  • Chomsky Hierarchy, Constructor term rewriting, Implicit Complexity

Number of downloads are based on statistics from Google Scholar and www.ku.dk


No data available

ID: 281991639