Document Open Access Logo

Shape Recognition by a Finite Automaton Robot

Authors Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler

PDF
Thumbnail PDF

File

LIPIcs.MFCS.2018.52.pdf
  • Filesize: 445 kB
  • 15 pages

Document Identifiers

Author Details

Robert Gmyr
  • Paderborn University, Germany
Kristian Hinnenthal
  • Paderborn University, Germany
Irina Kostitsyna
  • TU Eindhoven, the Netherlands
Fabian Kuhn
  • University of Freiburg, Germany
Dorian Rudolph
  • Paderborn University, Germany
Christian Scheideler
  • Paderborn University, Germany

Funding

This work is partly supported by DFG grant SCHE 1592/3-1. Fabian Kuhn is supported by ERC Grant 336495 (ACDC).

Cite AsGet BibTex

Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, and Christian Scheideler. Shape Recognition by a Finite Automaton Robot. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 52:1-52:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.MFCS.2018.52

Abstract

Motivated by the problem of shape recognition by nanoscale computing agents, we investigate the problem of detecting the geometric shape of a structure composed of hexagonal tiles by a finite-state automaton robot. In particular, in this paper we consider the question of recognizing whether the tiles are assembled into a parallelogram whose longer side has length l = f(h), for a given function f(*), where h is the length of the shorter side. To determine the computational power of the finite-state automaton robot, we identify functions that can or cannot be decided when the robot is given a certain number of pebbles. We show that the robot can decide whether l = ah+b for constant integers a and b without any pebbles, but cannot detect whether l = f(h) for any function f(x) = omega(x). For a robot with a single pebble, we present an algorithm to decide whether l = p(h) for a given polynomial p(*) of constant degree. We contrast this result by showing that, for any constant k, any function f(x) = omega(x^(6k + 2)) cannot be decided by a robot with k states and a single pebble. We further present exponential functions that can be decided using two pebbles. Finally, we present a family of functions f_n(*) such that the robot needs more than n pebbles to decide whether l = f_n(h).

Subject Classification

ACM Subject Classification
  • Theory of computation → Models of computation
  • Theory of computation → Design and analysis of algorithms
Keywords
  • finite automata
  • shape recognition
  • computational geometry

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. M. Blum and D. Kozen. On the power of the compass (or, why mazes are easier to search than graphs). In Proc. 19th Annual Symposium on Foundations of Computer Science (FOCS), pages 132-142, 1978. Google Scholar
  2. A. Bonato and R. J. Nowakowski. The Game of Cops and Robbers on Graphs. AMS, 2011. Google Scholar
  3. L. Budach. Automata and labyrinths. Mathematische Nachrichten, 86(1):195-282, 1978. Google Scholar
  4. S. Das. Mobile agents in distributed computing: Network exploration. Bulletin of the European Association for Theoretical Computer Science, 109:54-69, 2013. Google Scholar
  5. Zahra Derakhshandeh, Robert Gmyr, Andréa W. Richa, Christian Scheideler, and Thim Strothmann. Universal shape formation for programmable matter. In Proc. 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 289-299, 2016. Google Scholar
  6. Constantine Evans and Erik Winfree. DNA sticky end design and assignment for robust algorithmic self-assembly. In Proc. of DNA Computing and Molecular Computing (DNA), pages 61-75, 2013. Google Scholar
  7. Eliot D. Feldman and James C. Owings. A class of universal linear bounded automata. Information Sciences, 6(Supplement C):187-190, 1973. URL: http://dx.doi.org/10.1016/0020-0255(73)90036-4.
  8. F. V. Fomin and D. M. Thilikos. An annotated bibliography on guaranteed graph searching. Theoretical Computer Science, 399(3):236-245, jun 2008. Google Scholar
  9. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, and D. Peleg. Graph exploration by a finite automaton. Theoretical Computer Science, 345(2-3):331-344, 2005. Google Scholar
  10. R. Gmyr, I. Kostitsyna, F. Kuhn, C. Scheideler, and T. Strothmann. Forming tile shapes with a single robot. In Abstr. European Workshop on Computational Geometry (EuroCG), pages 9-12, 2017. Google Scholar
  11. F. Hoffmann. One pebble does not suffice to search plane labyrinths. In Proc. International Fundamentals of Computation Theory Conference (FCT), pages 433-444, 1981. Google Scholar
  12. S. Hong and Y. Yang. On the periodicity of an arithmetical function. Comptes Rendus Mathematique, 346(13):717-721, 2008. Google Scholar
  13. Ferran Hurtado, Enrique Molina, Suneeta Ramaswami, and Vera Sacristán. Distributed reconfiguraiton of 2D lattice-based modular robotic systems. Autonomous Robots, 38(4):383-413, 2015. Google Scholar
  14. G. Kilibarda, V. B. Kudryavtsev, and Š. Ušćumlić. Collectives of automata in labyrinths. Discrete Mathematics and Applications, 13(5):429-466, 2003. Google Scholar
  15. G. Kilibarda, V. B. Kudryavtsev, and Š. Ušćumlić. Independent systems of automata in labyrinths. Discrete Mathematics and Applications, 13(3):221-225, 2003. Google Scholar
  16. E. Markou. Identifying hostile nodes in networks using mobile agents. Bulletin of the European Association for Theoretical Computer Science, 108:93-129, 2012. Google Scholar
  17. Othon Michail and Paul G. Spirakis. Simple and efficient local codes for distributed stable network construction. Distributed Computing, 29(3):207-237, 2016. Google Scholar
  18. Marvin L. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, Inc., 1967. Google Scholar
  19. Jitsuro Nagura. On the interval containing at least one prime number. Proc. of the Japan Academy, 28(4):177-181, 1952. URL: http://dx.doi.org/10.3792/pja/1195570997.
  20. Matthew J. Patitz. An introduction to tile-based self-assembly and a survey of recent results. Natural Computing, 13(2):195-224, 2014. Google Scholar
  21. A. Pelc. Deterministic rendezvous in networks: A comprehensive survey. Networks, 59(3):331-347, 2012. Google Scholar
  22. John H. Reif and Sudheer Sahu. Autonomous programmable DNA nanorobotic devices using dnazymes. Theoretical Computer Science, 410:1428-1439, 2009. Google Scholar
  23. A. N. Shah. Pebble automata on arrays. Computer Graphics and Image Processing, 3(3):236-246, 1974. Google Scholar
  24. A.J. Thubagere, W. Li, R.F. Johnson, Z. Chen, S. Doroudi, Y.L. Lee, G. Izatt, S. Wittman, N. Srinivas, D. Woods, E. Winfree, and L. Qian. A cargo-sorting DNA robot. Science, 357(6356), 2017. Google Scholar
  25. S.F.J. Wickham, J. Bath, Y. Katsuda, M. Endo, K. Hidaka, H. Sugiyama, and A.J. Turberfield. A DNA-based molecular motor that can navigate a network of tracks. Nature Nanotechnology, 7(3):169-173, 2012. Google Scholar
  26. Damien Woods, Ho-Lin Chen, Scott Goodfriend, Nadine Dabby, Erik Winfree, and Peng Yin. Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In Proc. 4th Conference of Innovations in Theoretical Computer Science (ITCS), pages 353-354, 2013. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact