On the decidability of finding a positive ILP-instance in a regular set of ILP-instances

DOI10.1007/978-3-030-23247-4_21zbMath1434.68291OpenAlexW2954176761MaRDI QIDQ5970850

Petra Wolf

Publication date: 12 May 2020

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-23247-4_21

zbMATH Keywords

decidabilityinteger linear programmingregular languagesdeterministic finite automatonregular intersection emptiness problem

Mathematics Subject Classification ID

Integer programming (90C10) Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

Related Items (5)

Properties of graphs specified by a regular language ⋮ Properties of graphs specified by a regular language ⋮ On the decidability of finding a positive ILP-instance in a regular set of ILP-instances ⋮ From decidability to undecidability by considering regular sets of instances ⋮ Automata equipped with auxiliary data structures and regular realizability problems

This page was built for publication: On the decidability of finding a positive ILP-instance in a regular set of ILP-instances