Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2301.03708 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918431253594112 |
|---|---|
| author | Salomaa, Arto Salomaa, Kai Smith, Taylor J. |
| author_facet | Salomaa, Arto Salomaa, Kai Smith, Taylor J. |
| contents | The state complexity, respectively, nondeterministic state complexity of a regular language $L$ is the number of states of the minimal deterministic, respectively, of a minimal nondeterministic finite automaton for $L$. Some of the most studied state complexity questions deal with size comparisons of nondeterministic finite automata of differing degree of ambiguity. More generally, if for a regular language we compare the size of description by a finite automaton and by a more powerful language definition mechanism, such as a context-free grammar, we encounter non-recursive trade-offs. Operational state complexity studies the state complexity of the language resulting from a regularity preserving operation as a function of the complexity of the argument languages. Determining the state complexity of combined operations is generally challenging and for general combinations of operations that include intersection and marked concatenation it is uncomputable. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2301_03708 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Descriptional Complexity of Finite Automata -- Selected Highlights Salomaa, Arto Salomaa, Kai Smith, Taylor J. Formal Languages and Automata Theory The state complexity, respectively, nondeterministic state complexity of a regular language $L$ is the number of states of the minimal deterministic, respectively, of a minimal nondeterministic finite automaton for $L$. Some of the most studied state complexity questions deal with size comparisons of nondeterministic finite automata of differing degree of ambiguity. More generally, if for a regular language we compare the size of description by a finite automaton and by a more powerful language definition mechanism, such as a context-free grammar, we encounter non-recursive trade-offs. Operational state complexity studies the state complexity of the language resulting from a regularity preserving operation as a function of the complexity of the argument languages. Determining the state complexity of combined operations is generally challenging and for general combinations of operations that include intersection and marked concatenation it is uncomputable. |
| title | Descriptional Complexity of Finite Automata -- Selected Highlights |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2301.03708 |