Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/cc/BlondinKM16
%A Blondin, Michael
%A Krebs, Andreas
%A McKenzie, Pierre
%D 2016
%J Comput. Complex.
%K
%N 4
%P 775-814
%T The complexity of intersecting finite automata having few final states.
%U http://dblp.uni-trier.de/db/journals/cc/cc25.html#BlondinKM16
%V 25
@article{journals/cc/BlondinKM16,
added-at = {2023-12-13T03:08:38.000+0100},
author = {Blondin, Michael and Krebs, Andreas and McKenzie, Pierre},
biburl = {https://www.bibsonomy.org/bibtex/24bd1035f47542397780e3d082116ff9e/admin},
ee = {https://doi.org/10.1007/s00037-014-0089-9},
interhash = {88059f3c6c1866e6c3715c3c80f2b3a6},
intrahash = {4bd1035f47542397780e3d082116ff9e},
journal = {Comput. Complex.},
keywords = {},
number = 4,
pages = {775-814},
timestamp = {2023-12-13T03:08:38.000+0100},
title = {The complexity of intersecting finite automata having few final states.},
url = {http://dblp.uni-trier.de/db/journals/cc/cc25.html#BlondinKM16},
volume = 25,
year = 2016
}