Search - IFIP - Lecture Notes in Computer Science

3 results

	For these 3 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

		Reset Complexity of Ideal Languages Over a Binary Alphabet Marina Maslennikova 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.262-273, ⟨10.1007/978-3-319-60252-3_21⟩ Conference papers hal-01656997v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More
		Completely Reachable Automata Eugenija A. Bondar , Mikhail V. Volkov 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.1-17, ⟨10.1007/978-3-319-41114-9_1⟩ Conference papers hal-01633948v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More
		Primal Infon Logic with Conjunctions as Sets Carlos Cotrini , Yuri Gurevich , Ori Lahav , Artem Melentyev 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.236-249, ⟨10.1007/978-3-662-44602-7_19⟩ Conference papers hal-01402046v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More

Filter your results