Universal disjunctive concatenation and star
From MaRDI portal
Publication:5500693
DOI10.1007/978-3-319-19225-3_17zbMATH Open1432.68236OpenAlexW1176117539MaRDI QIDQ5500693FDOQ5500693
Authors: Nelma Moreira, Giovanni Pighizzini, Rogério Reis
Publication date: 7 August 2015
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10216/90789
Recommendations
Cites Work
- The state complexities of some basic operations on regular languages
- Alternation
- Intersection and union of regular languages and state complexity
- The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic
- Closures in formal languages and Kuratowski's theorem
- Optimal state reductions of automata with partially specified behaviors
Cited In (6)
- Formal languages over GF(2)
- Title not available (Why is that?)
- Optimal state reductions of automata with partially specified behaviors
- The dual of concatenation
- State complexity of Kleene-star operations on regular tree languages
- Universal witnesses for state complexity of Boolean operations and concatenation combined with star
This page was built for publication: Universal disjunctive concatenation and star
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500693)