Search - Descriptional Complexity of Formal Systems (DCFS 2017)

1 Array

	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

		2-State 2-Symbol Turing Machines with Periodic Support Produce Regular Sets Turlough Neary 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.274-286, ⟨10.1007/978-3-319-60252-3_22⟩ Conference papers hal-01657010v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More

Filter your results