Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
From MaRDI portal
Publication:1073019
Recommendations
Cites work
- scientific article; zbMATH DE number 3506659 (Why is no real title available?)
- scientific article; zbMATH DE number 3548404 (Why is no real title available?)
- scientific article; zbMATH DE number 3556037 (Why is no real title available?)
- scientific article; zbMATH DE number 3560706 (Why is no real title available?)
- scientific article; zbMATH DE number 3566194 (Why is no real title available?)
- scientific article; zbMATH DE number 3623543 (Why is no real title available?)
- scientific article; zbMATH DE number 3795357 (Why is no real title available?)
- scientific article; zbMATH DE number 3335016 (Why is no real title available?)
- Comparing Hierarchies of Primitive Recursive Sequence Functions
- Deterministic context free languages
- On primitive recursive wordfunctions
- Rekursive Wortfunktionen
- The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable
Cited in
(5)- scientific article; zbMATH DE number 19776 (Why is no real title available?)
- scientific article; zbMATH DE number 3849210 (Why is no real title available?)
- A hierarchy of loop programs over binary trees
- scientific article; zbMATH DE number 3995650 (Why is no real title available?)
- scientific article; zbMATH DE number 1149447 (Why is no real title available?)
This page was built for publication: Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073019)