Locally finite properties of data structures and their computation

DOI10.1007/BF01068559zbMath0575.68041OpenAlexW2007020817MaRDI QIDQ3694686

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

zbMATH Keywords

computabilitybounded treeselementary local predicatelocally finite predicate

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Some simplified NP-complete graph problems
• Data graphs and addressing schemes
• Stack and locally finite transformations on structures with reversible transitions
• DECIDABILITY PROBLEMS OF EXTENDED THEORIES
• Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Locally finite properties of data structures and their computation