Locally finite properties of data structures and their computation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3556125 (Why is no real title available?)
- Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems
- DECIDABILITY PROBLEMS OF EXTENDED THEORIES
- Data graphs and addressing schemes
- 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
- Some simplified NP-complete graph problems
- Stack and locally finite transformations on structures with reversible transitions
Cited in
(8)- scientific article; zbMATH DE number 4001459 (Why is no real title available?)
- Static data structure lower bounds imply rigidity
- PROVING PRODUCTIVITY IN INFINITE DATA STRUCTURES
- A Theory of Local Set Queries
- Data Structures Lower Bounds and Popular Conjectures
- Analysis of local enumeration and storage schemes in HPF
- scientific article; zbMATH DE number 1453077 (Why is no real title available?)
- Stack and locally finite transformations on structures with reversible transitions
This page was built for publication: Locally finite properties of data structures and their computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694686)