An Explicit Formula for the Intersection of Two Polynomials of Regular Languages

DOI10.1007/978-3-642-38771-5_5zbMath1381.68131OpenAlexW174709787MaRDI QIDQ5300827

Jean-Eric Pin

Publication date: 28 June 2013

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38771-5_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Concatenation hierarchies: new bottle, old wine ⋮ How many times do you need to go back to the future in unary temporal logic? ⋮ Separating Without Any Ambiguity. ⋮ Generic results for concatenation hierarchies ⋮ Unnamed Item ⋮ Characterizing level one in group-based concatenation hierarchies