The complexity of intersecting finite automata having few final states

DOI10.1007/978-3-642-30642-6_4zbMATH Open1360.68495OpenAlexW2177646325MaRDI QIDQ2907484FDOQ2907484

Authors: Michael Blondin, Pierre McKenzie 

Publication date: 10 September 2012

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30642-6_4

Recommendations

• The complexity of intersecting finite automata having few final states
• The intersection problem for finite monoids
• The emptiness problem for intersections of regular languages
• An intersection problem for finite automata
• Complexity Analysis: Transformation Monoids of Finite Automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited In (6)

• The complexity of interacting automata
• An intersection problem for finite automata
• The complexity of intersecting finite automata having few final states
• The intersection problem for finite monoids
• The emptiness problem for intersections of regular languages
• On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)

This page was built for publication: The complexity of intersecting finite automata having few final states

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