@inproceedings{wolf:hal-02387299,
  TITLE = {{On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances}},
  AUTHOR = {Wolf, Petra},
  URL = {https://inria.hal.science/hal-02387299},
  BOOKTITLE = {{21th International Conference on Descriptional Complexity of Formal Systems (DCFS)}},
  ADDRESS = {Ko{\v s}ice, Slovakia},
  EDITOR = {Michal Hospod{\'a}r and Galina Jir{\'a}skov{\'a} and Stavros Konstantinidis},
  PUBLISHER = {{Springer International Publishing}},
  SERIES = {Descriptional Complexity of Formal Systems},
  VOLUME = {LNCS-11612},
  PAGES = {272-284},
  YEAR = {2019},
  MONTH = Jul,
  DOI = {10.1007/978-3-030-23247-4\_21},
  KEYWORDS = {Deterministic finite automaton ; Regular languages ; Regular intersection emptiness problem ; Decidability ; Integer linear programming},
  PDF = {https://inria.hal.science/hal-02387299/file/480958_1_En_21_Chapter.pdf},
  HAL_ID = {hal-02387299},
  HAL_VERSION = {v1},
}