
handle: 2027.42/32014
This paper studies errors in finite automata. An error is defined as a pair of states and errors are then classified according to their probability of being corrected (i.e., being taken into the same state). Various results are then given on the partitioning properties of a particular type of error called a finite error.
Science (General), Engineering, Science, Computer Science, Information and Library Science, Social Sciences, mathematical logic, Engineering(all)
Science (General), Engineering, Science, Computer Science, Information and Library Science, Social Sciences, mathematical logic, Engineering(all)
| 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). | 5 | |
| 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 |
