Two-dimensional jumping finite automata

dc.contributor.authorJames Immanuel, S.
dc.contributor.authorThomas, D. G.
dc.coverage.issue2cs
dc.coverage.volume5cs
dc.date.accessioned2017-02-03T11:15:55Z
dc.date.available2017-02-03T11:15:55Z
dc.date.issued2016cs
dc.description.abstractIn 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.en
dc.formattextcs
dc.format.extent105-122cs
dc.format.mimetypeapplication/pdfen
dc.identifier.citationMathematics for Applications. 2016 vol. 5, č. 2, s. 105-122. ISSN 1805-3629cs
dc.identifier.doi10.13164/ma.2016.08en
dc.identifier.issn1805-3629
dc.identifier.urihttp://hdl.handle.net/11012/63784
dc.language.isoencs
dc.publisherVysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematikycs
dc.relation.ispartofMathematics for Applicationsen
dc.relation.urihttp://ma.fme.vutbr.cz/archiv/5_2/ma_5_2_james_immanuel_thomas_final.pdfcs
dc.rights© Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematikycs
dc.rights.accessopenAccessen
dc.subjectpicture languagesen
dc.subjectjumping automataen
dc.subjectrectangular arraysen
dc.titleTwo-dimensional jumping finite automataen
dc.type.driverotheren
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen
eprints.affiliatedInstitution.departmentÚstav matematikycs
eprints.affiliatedInstitution.facultyFakulta strojního inženýrstvícs
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
ma_5_2_james_immanuel_thomas_final.pdf
Size:
813.18 KB
Format:
Adobe Portable Document Format
Description:
Collections