The Complexity of Intersecting Finite Automata Having Few Final States

DOI10.1007/978-3-642-30642-6_4zbMath1360.68495OpenAlexW2177646325MaRDI QIDQ2907484

Pierre McKenzie, Michael Blondin

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

Mathematics Subject Classification ID

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

Related Items (1)

The complexity of intersecting finite automata having few final states

This page was built for publication: The Complexity of Intersecting Finite Automata Having Few Final States