
A number of results about deterministic languages (languages accepted by pushdown automata with no choice of moves) are established. In particular,o(1)each deterministic language is unambiguous.(2)the complement of each deterministic language is a deterministic language.(3)numerous operations which preserve deterministic languages (for example, intersection with a regular set) are obtained.(4)several problems are shown to be recursively unsolvable.
mathematical logic, Engineering(all)
mathematical logic, Engineering(all)
| selected citations These citations are derived from selected sources. 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). | 181 | |
| 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. | Top 10% | |
| 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 0.1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
