Search - Descriptional Complexity of Formal Systems

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

		Square, Power, Positive Closure, and Complementation on Star-Free Languages Sylvie Davies , Michal Hospodár 21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.98-110, ⟨10.1007/978-3-030-23247-4_7⟩ Conference papers hal-02387295v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More
		Descriptional Complexity of Formal Systems Michal Hospodár , Galina Jirásková , Stavros Konstantinidis Springer International Publishing, LNCS-11612, 2019, Lecture Notes in Computer Science, 978-3-030-23246-7. ⟨10.1007/978-3-030-23247-4⟩ Books hal-02387282v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More
		NFA-to-DFA Trade-Off for Regular Operations Galina Jirásková , Ivana Krajňáková 21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.184-196, ⟨10.1007/978-3-030-23247-4_14⟩ Conference papers hal-02387289v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More

Filter your results