Complexity of atoms of regular languages
author
Brzozowski, Janusz
Tamm, Hellis
statement of authorship
Janusz Brzozowski, Hellis Tamm
source
International Journal of Foundations of Computer Science
publisher
World Scientific Publishing
journal volume number month
Vol. 24, 7
year of publication
2013
pages
p. 1009 - 1027
url
https://doi.org/10.1142/S0129054113400285
subject term
aatomid
regulaarsed keeled
programmeerimine
keyword
atomic NFA
atoms
finite automaton
quotient complexity
regular language
state complexity
syntactic semigroup
witness
ISSN
0129-0541
notes
Bibliogr.: 10 ref
Open Access
Open Access
scientific publication
teaduspublikatsioon
classifier
1.1
Scopus
https://www.scopus.com/sourceid/4700152641
https://www.scopus.com/record/display.uri?eid=2-s2.0-84897656838&origin=resultslist&sort=plf-f&src=s&sot=b&sdt=b&s=DOI%2810.1142%2FS0129054113400285%29&sessionSearchId=f5537800810c8e1f4bbc115ea06ecda6
WOS
https://jcr.clarivate.com/jcr-jp/journal-profile?journal=INT%20J%20FOUND%20COMPUT%20S&year=2013
https://www.webofscience.com/wos/woscc/full-record/WOS:000332114100006
category (general)
Computer Science
Arvutiteadus
category (sub)
Computer science. Computer science (miscellaneous)
Arvutiteadus. Arvutiteadus (mitmesugused)
quartile
Q2
TalTech department
küberneetika instituut
language
inglise