Stack and locally finite transformations on structures with reversible transitions
From MaRDI portal
Recommendations
Cites work
- A system which automatically improves programs
- An efficient machine-independent procedure for garbage collection in various list structures
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Generalized finite automata theory with an application to a decision problem of second-order logic
- scientific article; zbMATH DE number 3644474 (Why is no real title available?)
- scientific article; zbMATH DE number 3644475 (Why is no real title available?)
- scientific article; zbMATH DE number 3731318 (Why is no real title available?)
- scientific article; zbMATH DE number 3471564 (Why is no real title available?)
- scientific article; zbMATH DE number 3471979 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 3635529 (Why is no real title available?)
- Notes on recursion elimination
- Structural equivalence of context-free grammars
Cited in
(3)
This page was built for publication: Stack and locally finite transformations on structures with reversible transitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3332226)