A class of functions computable by index grammars

DOI10.1023/A:1023877210866zbMath1063.68061OpenAlexW81740023MaRDI QIDQ1429059

L. P. Lisovik, T. A. Karnaukh

Publication date: 29 March 2004

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1023877210866

zbMATH Keywords

linear recurrence relationscomputabilityclosure property

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Word-mappings of level 2

This page was built for publication: A class of functions computable by index grammars