Circuit complexity of regular languages

Number of the records: 1

1.

SYSNO	0336039
Title	Circuit complexity of regular languages
Author(s)	Koucký, Michal (MU-W)_{RID, SAI, ORCID}
Source Title	Theory of Computing Systems. Roč. 45, č. 4 (2009), s. 865-879. - : Springer
Document Type	Článek v odborném periodiku
Grant	GP201/07/P276 GA ČR - Czech Science Foundation (CSF)
	1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic
CEZ	AV0Z10190503 - MU-W (2005-2011)
Language	eng
Country	US
Keywords	regular languages * circuit complexity * upper and lower bounds
Permanent Link	http://hdl.handle.net/11104/0180367

	File	Download	Size	Commentary	Version	Access
	Koucky2.pdf	1	323.5 KB		Publisher’s postprint	require

Number of the records: 1