Further Remarks on the Operational Nonterminal Complexity
From MaRDI portal
Recommendations
Cites work
- A survey on operational state complexity
- Concatenation of Regular Languages and Descriptional Complexity
- Descriptional complexity of union and star on context-free languages
- scientific article; zbMATH DE number 1962776 (Why is no real title available?)
- Incomplete operational transition complexity of regular languages
- Language operations with regular expressions of polynomial size
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- On the number of accepting states of finite automata
- Operational complexity and right linear grammars
- Regular expressions: new results and open problems
- State complexity of cyclic shift
- The ranges of accepting state complexities of languages resulting from some operations
- The ranges of state complexities for complement, star, and reversal of regular languages
- The state complexities of some basic operations on regular languages
- Transition complexity of incomplete DFAs
Cited in
(4)
This page was built for publication: Further Remarks on the Operational Nonterminal Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6114830)