Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages

Number of the records: 1

Title	Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
Author	Jirásková Galina 1963 SAVMATEM - Matematický ústav SAV
Co-authors	Mlynárčik Peter 1972 SAVMATEM - Matematický ústav SAV

Source document	Proc. Descriptional Complexity of Formal Systems - 16th International Workshop (DCFS 2014), Lecture Notes in Computer Science, vol. 8614. S. 222-233. - Turku, Finland : Springer, 2014
Language	eng - English
Country	FI - Finland
Document kind	rozpis článkov z periodík (rzb)
Citations	HOSPODÁR, Michal. Descriptional Complexity of Power and Positive Closure on Convex Languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ISSN 03029743, 2019-01-01, 11601 LNCS, p. 158-170.
	HOSPODAR, Michal. Power, positive closure, and quotients on convex languages. In THEORETICAL COMPUTER SCIENCE, 2021, vol. 870, p. 53-74. ISSN 0304-3975. Dostupné na: https://doi.org/10.1016/j.tcs.2021.02.002.
Category	AEC - Scientific papers in foreign peer-reviewed proceedings, monographs
Category of document (from 2022)	V2 - Vedecký výstup publikačnej činnosti ako časť editovanej knihy alebo zborníka
Type of document	príspevok
Year	2014

article

rok vydania	rok metriky	IF	IF Q (best)	SJR	SJR Q (best)
2014

Number of the records: 1