Locally finite properties of data structures and their computation

DOI10.1007/BF01068559zbMATH Open0575.68041OpenAlexW2007020817MaRDI QIDQ3694686FDOQ3694686

Authors: Anatoly V. Anisimov 

Publication date: 1983

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068559

Recommendations

• Stack and locally finite transformations on structures with reversible transitions
• Locally finite theories
• Deciding first-order properties of locally tree-decomposable structures
• scientific article; zbMATH DE number 4008363
• scientific article; zbMATH DE number 4203713

zbMATH Keywords

computabilitybounded treeselementary local predicatelocally finite predicate

Mathematics Subject Classification ID

Data structures (68P05) Abstract data types; algebraic specification (68Q65)

Cites Work

• Decidability of Second-Order Theories and Automata on Infinite Trees
• Some simplified NP-complete graph problems
• Generalized finite automata theory with an application to a decision problem of second-order logic
• 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
• Title not available (Why is that?)
• Stack and locally finite transformations on structures with reversible transitions

Cited In (8)

• Static data structure lower bounds imply rigidity
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)