Orthogonal concatenation: language equations and state complexity

zbMATH Open1216.68141MaRDI QIDQ4929403FDOQ4929403

Authors: Mark Daley, Michael Domaratzki, Kai Salomaa 

Publication date: 22 September 2010

Full work available at URL: http://www.jucs.org/jucs_16_5/orthogonal_concatenation_language_equations

Recommendations

• Concatenation of regular languages and descriptional complexity
• Concatenation of Regular Languages and Descriptional Complexity
• The complexity of languages resulting from the concatenation operation
• The Complexity of Languages Resulting from the Concatenation Operation
• Implementation and Application of Automata

zbMATH Keywords

decidabilityregular languageslanguage equationsstate complexitylanguage operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (10)

• The Complexity of Languages Resulting from the Concatenation Operation
• State complexity of GF(2)-operations on unary languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• On language decompositions and primality
• Orthogonal shuffle on trajectories
• Notes on dual concatenation
• State complexity of unambiguous operations on finite automata
• Formal languages over GF(2)
• Shuffled languages -- representation and recognition

This page was built for publication: Orthogonal concatenation: language equations and state complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4929403)