On measuring nondeterminism in regular languages
Information and Computation
Discrete Applied Mathematics
Automaticity I: properties of a measure of descriptional complexity
Journal of Computer and System Sciences
Minimal cover-automata for finite languages
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Tradeoffs between reliability and conciseness of deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
On the existence of regular approximations
Theoretical Computer Science
On Approximating Non-regular Languages by Regular Languages
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
| Hi-index | 0.00 |
In this paper, we propose qualitative measures for the reliability of representations of languages by deterministic finite automata. We analyze the relationships between different qualitative features and investigate tradeoffs between different qualitative levels of reliability. Furthermore, we prove that the savings in the number of states between representations having different qualitative features cannot be bounded by any function. These results hold even when the descriptions are required to exceed any given fixed level of quantified reliability.