of finite automata Karlis Jerins The concept Finite number of components Each component is a finite automaton minus read head State transitions are performed depending on neighbors ID: 481460
Download Presentation The PPT/PDF document "Grids" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Slide1
Grids of finite automata
Karlis
JerinsSlide2
The concept
Finite
number of
components
Each component is a finite automaton minus read
head
State transitions are performed depending on
neighbors
’ current
states
One component is designated as the main
component
When the main component
halts
, its last state is transformed into the
answerSlide3
The results
All
regular languages can be
recognized
Components arranged in a single
line
The grid emulates the minimal
1-DFA
Certain context-free languates can be
recognized
{0
n
1
n
} and
{w#w
rev
}
Components arranged in a single
line
Certain context-sensitive languages can be
recognized
{0
n
1
n
2
n
} and
{ww}
Components arranged in multiple
linesSlide4
Future work
Set more precise bounds on computational power
Investigate the importance of the grid
Investigate use of non-deterministic componentsSlide5
Thank you
for
your
attention
!