Euclidean geometry in terms of automata theory

DOI10.1016/0304-3975(89)90120-5zbMath0678.68055OpenAlexW2054209870MaRDI QIDQ1124346

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

geometric algorithmscomputational geometrygeometric automata

Mathematics Subject Classification ID

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

Related Items (5)

Abstract geometrical computation. VIII: Small machines, accumulations \& rationality ⋮ On geometric automata which can nondeterministically choose auxiliary points ⋮ A result about the power of geometric oracle machines ⋮ Abstract geometrical computation. III: Black holes for classical and analog computing ⋮ Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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