The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic
From MaRDI portal
Publication:2423779
DOI10.1016/0020-0190(96)00044-0zbMath1410.68197OpenAlexW1970741809MaRDI QIDQ2423779
Publication date: 20 June 2019
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(96)00044-0
Related Items
The state complexity of \(L^{2}\) and \(L^k\) ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Descriptional Complexity of the Forever Operator ⋮ Universal Disjunctive Concatenation and Star
Cites Work
- Unnamed Item
- On equations for regular languages, finite automata, and sequential networks
- Partial orders on words, minimal elements of regular languages, and state complexity
- Succinct representation of regular languages by Boolean automata. II
- Succinct representation of regular languages by Boolean automata
- Intersection and union of regular languages and state complexity
- On the expressive power of temporal logic
- Alternation