1 / 4

Nonconstructive Language Recognition by Finite Automata

Nonconstructive Language Recognition by Finite Automata. Kaspars Balodis, Rusins Freivalds, Lauma Pretkalnina, Inga Rumkovska, Madars Virza. Nonconstructive Language Recognition. Two-way automaton equipped with an additional tape where nonconstructive help (advice) is fed in

melanieclark
Download Presentation

Nonconstructive Language Recognition by Finite Automata

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Nonconstructive Language Recognition by Finite Automata Kaspars Balodis, Rusins Freivalds, Lauma Pretkalnina, Inga Rumkovska, Madars Virza

  2. Nonconstructive Language Recognition • Two-way automaton equipped with an additional tape where nonconstructive help (advice) is fed in • For every word length n there is a help y(n) • Given a correct help y(n) automaton should give correct answer to any word x whose length does not exceed n • Amount of nonconstructivity (minimal length of help words |y(n)|) to recognize a language L is considered

  3. Our results • Tight upper bound Θ(2n) of amount of nonconstructivity that can be needed to recognize a language • Results on multi-tape finite automata • Nonregular language that can be recognized with nonconstructivity O(ln n) on 2 tapes • A Turing machine using space f(n) can be simulated with an automaton using nonconstructivity cf(n) on 4 tapes

  4. See you at the poster! Thank you!

More Related