Saved in:
Bibliographic Details
Main Authors: D, Deepalakshmi, Mathew, Lisa
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2508.07779
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912532367671296
author D, Deepalakshmi
Mathew, Lisa
author_facet D, Deepalakshmi
Mathew, Lisa
contents Two new classes of finite automata, called General hexagonal Boustrophedon finite automata and General hexagonal returning finite automata operating on hexagonal grids, are introduced and analyzed. The work establishes the theoretical foundations for these automata models, examines their computational properties, and investigates the relationships and equivalences between the language families they define. The research contributes to the broader understanding of two-dimensional automata theory by extending classical finite automaton concepts to hexagonal geometric structures with specialized traversal patterns.
format Preprint
id arxiv_https___arxiv_org_abs_2508_07779
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Hexagonal Picture Scanning Automata
D, Deepalakshmi
Mathew, Lisa
Formal Languages and Automata Theory
68Q45, 52C20, 68U05, 68U10
F.1.1
Two new classes of finite automata, called General hexagonal Boustrophedon finite automata and General hexagonal returning finite automata operating on hexagonal grids, are introduced and analyzed. The work establishes the theoretical foundations for these automata models, examines their computational properties, and investigates the relationships and equivalences between the language families they define. The research contributes to the broader understanding of two-dimensional automata theory by extending classical finite automaton concepts to hexagonal geometric structures with specialized traversal patterns.
title Hexagonal Picture Scanning Automata
topic Formal Languages and Automata Theory
68Q45, 52C20, 68U05, 68U10
F.1.1
url https://arxiv.org/abs/2508.07779