Universal disjunctive concatenation and star

DOI10.1007/978-3-319-19225-3_17MaRDI QIDQ5500693zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Implementation and Application of Automata
• STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
• Concatenation of regular languages and descriptional complexity
• Concatenation of Regular Languages and Descriptional Complexity
• The state complexities of some basic operations on regular languages

Cites work

• Alternation
• Closures in formal languages and Kuratowski's theorem
• Intersection and union of regular languages and state complexity
• Optimal state reductions of automata with partially specified behaviors
• The state complexities of some basic operations on regular languages
• The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic

Cited in

(6)

• Formal languages over GF(2)
• scientific article; zbMATH DE number 1916665 (Why is no real title available?)
• 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)