Searching for authors named "Dainis Geidmanis" – sorted by Relevance.
-
Single-Letter Languages Accepted By Alternating and Probabilistic Pushdown Automata
- We consider 1-way k-tape alternating pushdown automata (k-apa) and 1-way k-tape alternating finite automata (k-afa). We say that an alternating automaton accepts a language L with f(n)-bounded maximal (respectively, minimal) leaf-size if arbitrary (respectively, at least one) accepting tree for any
- Add To MetaCart

