Jflap Activities for Formal Languages and Automata: | Guide books

Jflap Activities for Formal Languages and AutomataDecember 2008

Publisher:

ISBN:978-0-7637-7202-4

Published:31 December 2008

Bibliometrics

No abstract available.

Contributors

Index Terms

Please enable JavaScript to view thecomments powered by Disqus.

Limited Automata and Context-Free Languages
Non-Classical Models of Automata and Applications V

Limited automata are one-tape Turing machines which are allowed to rewrite each tape cell only in the first d visits, for a given constant d. For each d ≥ 2, these devices characterize the class of context-free languages. We investigate the equivalence ...
Deterministic Pushdown Automata and Unary Languages
CIAA '08: Proceedings of the 13th international conference on Implementation and Applications of Automata

The simulation of deterministic pushdown automata defined over a one letter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be ...
Alternating automata and a temporal fixpoint calculus for visibly pushdown languages
CONCUR'07: Proceedings of the 18th international conference on Concurrency Theory

We investigate various classes of alternating automata for visibly pushdown languages (VPL) over infinite words. First, we show that alternating visibly pushdown automata (AVPA) are exactly as expressive as their nondeterministic counterpart (NVPA) but ...