Search - Descriptional Complexity of Formal Systems

1 Array

Keywords : Deterministic finite automaton

	For these 1 documents Send to ORCID RSS ATOM Export BibTeX XML-TEI CSV RTF EndNote PDF HTML Advanced export	Page :	sorted by Relevance Author A→Z Author Z→A Title A→Z Title Z→A Increasing publication date Decreasing publication date Increasing deposit date Decreasing deposit date

		On the Decidability of Finding a Positive ILP-Instance in a Regular Set of ILP-Instances Petra Wolf 21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.272-284, ⟨10.1007/978-3-030-23247-4_21⟩ Conference papers hal-02387299v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More