On the power of alternation in automata theory
Copyright policy )On the power of alternation in automata theory
An extended abstract of this paper appeared in Lect. Notes Comput. Sci. 176, 322-329 (1984; Zbl 0571.68035).
- Comenius University Slovakia
polynomial time, Computer Networks and Communications, Analysis of algorithms and problem complexity, Applied Mathematics, P, Formal languages and automata, Turing machines, Models of computation (Turing machines, etc.), one-way multicounter machines, Theoretical Computer Science, multihead finite automata, Computational Theory and Mathematics, blind counters
polynomial time, Computer Networks and Communications, Analysis of algorithms and problem complexity, Applied Mathematics, P, Formal languages and automata, Turing machines, Models of computation (Turing machines, etc.), one-way multicounter machines, Theoretical Computer Science, multihead finite automata, Computational Theory and Mathematics, blind counters
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).23 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!