Euclidean geometry in terms of automata theory

DOI10.1016/0304-3975(89)90120-5MaRDI QIDQ1124346zbMATH OpenOpenAlexFDO

Authors Ulrich Huckenbeck

Publication date 1989

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(89)90120-5

zbMATH Keywords

computational geometrygeometric algorithmsgeometric automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Euclidean geometries (general) and generalizations (51M05)

Recommendations

• scientific article; zbMATH DE number 4072392
• scientific article; zbMATH DE number 4160161
• Automatted geometry theorem proving
• scientific article; zbMATH DE number 2247478
• Geometric computations by broadcasting automata
• Automated reasoning in geometry
• scientific article; zbMATH DE number 994744
• Publication:4946075

Cited in

(7)

• Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
• scientific article; zbMATH DE number 4072392 (Why is no real title available?)
• Abstract geometrical computation. III: Black holes for classical and analog computing
• A result about the power of geometric oracle machines
• On geometric automata which can nondeterministically choose auxiliary points
• scientific article; zbMATH DE number 5946208 (Why is no real title available?)
• Abstract geometrical computation. VIII: Small machines, accumulations \& rationality

This page was built for publication: Euclidean geometry in terms of automata theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124346)