Universal Disjunctive Concatenation and Star

DOI10.1007/978-3-319-19225-3_17zbMath1432.68236OpenAlexW1176117539MaRDI QIDQ5500693

Rogério Reis, Giovanni Pighizzini, Nelma Moreira

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Optimal state reductions of automata with partially specified behaviors

Cites Work

• Intersection and union of regular languages and state complexity
• The state complexities of some basic operations on regular languages
• The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic
• CLOSURES IN FORMAL LANGUAGES AND KURATOWSKI'S THEOREM
• Alternation
• Optimal State Reductions of Automata with Partially Specified Behaviors

This page was built for publication: Universal Disjunctive Concatenation and Star