Detail publikace

On Parallel Versions of Jumping Finite Automata

KOCMAN, R. MEDUNA, A.

Originální název

On Parallel Versions of Jumping Finite Automata

Anglický název

On Parallel Versions of Jumping Finite Automata

Jazyk

en

Originální abstrakt

The present paper proposes a new investigation area in automata theory -- n-parallel jumping finite automata. These automata further extend recently presented jumping finite automata that are focused on discontinuous reading. The proposed modification uses multiple reading heads that work in parallel and can discontinuously read from the input in several places at once. We also define the more restricted version of these automata which only allows jumping to the right. This restricted version is then further studied, compared with n-parallel right linear grammars, and several of its properties are derived.

Anglický abstrakt

The present paper proposes a new investigation area in automata theory -- n-parallel jumping finite automata. These automata further extend recently presented jumping finite automata that are focused on discontinuous reading. The proposed modification uses multiple reading heads that work in parallel and can discontinuously read from the input in several places at once. We also define the more restricted version of these automata which only allows jumping to the right. This restricted version is then further studied, compared with n-parallel right linear grammars, and several of its properties are derived.

Dokumenty

BibTex


@inproceedings{BUT119917,
  author="Radim {Kocman} and Alexandr {Meduna}",
  title="On Parallel Versions of Jumping Finite Automata",
  annote="The present paper proposes a new investigation area in automata theory --
n-parallel jumping finite automata. These automata further extend recently
presented jumping finite automata that are focused on discontinuous reading. The
proposed modification uses multiple reading heads that work in parallel and can
discontinuously read from the input in several places at once. We also define the
more restricted version of these automata which only allows jumping to the right.
This restricted version is then further studied, compared with n-parallel right
linear grammars, and several of its properties are derived.",
  address="Springer International Publishing",
  booktitle="Proceedings of the 2015 Federated Conference on Software Development and Object Technologies",
  chapter="119917",
  doi="10.1007/978-3-319-46535-7_12",
  edition="Advances in Intelligent Systems and Computing",
  howpublished="print",
  institution="Springer International Publishing",
  year="2016",
  month="december",
  pages="142--149",
  publisher="Springer International Publishing",
  type="conference paper"
}