Skip to main content
Article thumbnail
Location of Repository

Jumping Finite Automata and Transducers

By Juraj Hrubý


The bachelor's thesis builds upon the study of jumping finite automata and introduces jumping finite transducers. Jumping finite automata are finite automata modified in such a way that symbols from the input tape are not read continuously from left to right but that the reading head can make moves on the input tape by jumps. Jumping finite transducers are finite transducers modified in a very similar way. In order to implement jumping finite automata and transducers, strictly deterministic versions of them were introduced by restricting the finite state control and by modification of the binary jumping relation. The thesis furthermore focuses on possible usage of jumping finite automata and transducers and on the description of the implementation of strictly deterministic jumping finite automata

Topics: striktní determinismus; implementace; jumping finite transducers; skákající konečné automaty; implementation; skákající konečné převodníky; strict determinism; využití; usage; jumping finite automata
Publisher: Vysoké učení technické v Brně. Fakulta informačních technologií
Year: 2013
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.