National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Jumping Finite Automata and Transducers
Hrubý, Juraj ; Burgetová, Ivana (referee) ; Meduna, Alexandr (advisor)
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.
Jumping Finite Automata and Transducers
Hrubý, Juraj ; Burgetová, Ivana (referee) ; Meduna, Alexandr (advisor)
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.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.