Two-dimensional jumping finite automata
Loading...
Date
2016
Authors
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky
Altmetrics
Abstract
In this paper, we extend a newly introduced concept called the jumping nite automata for accepting string languages to two-dimensional jumping nite automata for accepting two-dimensional languages. We discuss some of the basic properties of these automata and compare the family of languages accepted by these automata with the family of Siromoney matrix languages and also recognizable picture languages (REC). We also discuss some of the closure properties of these automata along with some of their decidability properties.
Description
Citation
Mathematics for Applications. 2016 vol. 5, č. 2, s. 105-122. ISSN 1805-3629
http://ma.fme.vutbr.cz/archiv/5_2/ma_5_2_james_immanuel_thomas_final.pdf
http://ma.fme.vutbr.cz/archiv/5_2/ma_5_2_james_immanuel_thomas_final.pdf
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en
Study field
Comittee
Date of acceptance
Defence
Result of defence
Document licence
© Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky