{"id":"https://openalex.org/W1982858621","doi":"https://doi.org/10.1142/s0129054108005619","title":"EFFICIENT AUTOMATA CONSTRUCTIONS AND APPROXIMATE AUTOMATA","display_name":"EFFICIENT AUTOMATA CONSTRUCTIONS AND APPROXIMATE AUTOMATA","publication_year":2008,"publication_date":"2008-02-01","ids":{"openalex":"https://openalex.org/W1982858621","doi":"https://doi.org/10.1142/s0129054108005619","mag":"1982858621"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054108005619","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054108005619","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027422026","display_name":"Bruce W. Watson","orcid":"https://orcid.org/0000-0003-0511-1837"},"institutions":[{"id":"https://openalex.org/I69552723","display_name":"University of Pretoria","ror":"https://ror.org/00g0p6g84","country_code":"ZA","type":"education","lineage":["https://openalex.org/I69552723"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"BRUCE W. WATSON","raw_affiliation_strings":["FASTAR Research group, Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa","FST Labs Inc., Kelowna, Canada"],"affiliations":[{"raw_affiliation_string":"FASTAR Research group, Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa","institution_ids":["https://openalex.org/I69552723"]},{"raw_affiliation_string":"FST Labs Inc., Kelowna, Canada","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106185216","display_name":"Derrick G. Kourie","orcid":null},"institutions":[{"id":"https://openalex.org/I69552723","display_name":"University of Pretoria","ror":"https://ror.org/00g0p6g84","country_code":"ZA","type":"education","lineage":["https://openalex.org/I69552723"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"DERRICK G. KOURIE","raw_affiliation_strings":["Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa","institution_ids":["https://openalex.org/I69552723"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037337926","display_name":"Tinus Strauss","orcid":null},"institutions":[{"id":"https://openalex.org/I69552723","display_name":"University of Pretoria","ror":"https://ror.org/00g0p6g84","country_code":"ZA","type":"education","lineage":["https://openalex.org/I69552723"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"TINUS STRAUSS","raw_affiliation_strings":["Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa","institution_ids":["https://openalex.org/I69552723"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5097663908","display_name":"ERNEST KETCHA","orcid":null},"institutions":[{"id":"https://openalex.org/I165390105","display_name":"University of South Africa","ror":"https://ror.org/048cwvf49","country_code":"ZA","type":"education","lineage":["https://openalex.org/I165390105"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"ERNEST KETCHA","raw_affiliation_strings":["School of Computing, University of South Africa, Pretoria, 0002, South Africa"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of South Africa, Pretoria, 0002, South Africa","institution_ids":["https://openalex.org/I165390105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043799147","display_name":"Loek Cleophas","orcid":"https://orcid.org/0000-0002-7221-3676"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"LOEK CLEOPHAS","raw_affiliation_strings":["Faculty of Computing Science and Mathematics, Eindhoven University of Technology, Eindhoven, Netherlands","Model Driven Software Engineering W&I"],"affiliations":[{"raw_affiliation_string":"Faculty of Computing Science and Mathematics, Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Model Driven Software Engineering W&I","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5027422026"],"corresponding_institution_ids":["https://openalex.org/I69552723"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.062031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"19","issue":"01","first_page":"185","last_page":"193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.787059485912323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.625625729560852},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5733245611190796},{"id":"https://openalex.org/keywords/mobile-automaton","display_name":"Mobile automaton","score":0.5456900596618652},{"id":"https://openalex.org/keywords/\u03c9-automaton","display_name":"\u03c9-automaton","score":0.5380226373672485},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.5193341970443726},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49083787202835083},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4894198477268219},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.46209967136383057},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.4555044174194336},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4394459128379822},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.43532755970954895},{"id":"https://openalex.org/keywords/continuous-spatial-automaton","display_name":"Continuous spatial automaton","score":0.411687970161438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.407688707113266},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3296199440956116},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10060808062553406}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.787059485912323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.625625729560852},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5733245611190796},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.5456900596618652},{"id":"https://openalex.org/C92710233","wikidata":"https://www.wikidata.org/wiki/Q291256","display_name":"\u03c9-automaton","level":5,"score":0.5380226373672485},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.5193341970443726},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49083787202835083},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4894198477268219},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.46209967136383057},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.4555044174194336},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4394459128379822},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.43532755970954895},{"id":"https://openalex.org/C75745568","wikidata":"https://www.wikidata.org/wiki/Q5165519","display_name":"Continuous spatial automaton","level":5,"score":0.411687970161438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.407688707113266},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3296199440956116},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10060808062553406},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129054108005619","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054108005619","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/b3c96525-2ff5-4c61-b305-65825facf6d2","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/b3c96525-2ff5-4c61-b305-65825facf6d2","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Watson, B W, Kourie, D G, Strauss, T, Ngassam, E K & Cleophas, L G 2008, 'Efficient automata constructions and approximate automata', International Journal of Foundations of Computer Science, vol. 19, no. 1, pp. 185-193. https://doi.org/10.1142/S0129054108005619","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/b3c96525-2ff5-4c61-b305-65825facf6d2","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/b3c96525-2ff5-4c61-b305-65825facf6d2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Foundations of Computer Science, 19(1), 185 - 193. World Scientific","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2073586690","https://openalex.org/W2156429182","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2368684504","https://openalex.org/W4205935260","https://openalex.org/W4386400090","https://openalex.org/W4382203044","https://openalex.org/W2169203237","https://openalex.org/W1975910189","https://openalex.org/W4310283533","https://openalex.org/W2173305072","https://openalex.org/W2012286375","https://openalex.org/W1978638999"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"data":[5],"structures":[6],"and":[7,58],"algorithms":[8],"for":[9,17],"efficiently":[10],"constructing":[11],"approximate":[12,15],"automata.":[13,67],"An":[14],"automaton":[16],"a":[18,34,49],"regular":[19],"language":[20],"L":[21],"is":[22,55,59],"one":[23],"which":[24,45],"accepts":[25],"at":[26],"leastL.":[27],"Such":[28],"automata":[29],"can":[30],"be":[31],"used":[32],"in":[33,44],"variety":[35],"of":[36],"practical":[37],"applications,":[38],"including":[39],"network":[40],"security":[41],"pattern":[42],"matching,":[43],"false-matches":[46],"are":[47],"only":[48],"performance":[50],"nuisance.":[51],"The":[52],"construction":[53],"algorithm":[54],"particularly":[56],"efficient,":[57],"tunable":[60],"to":[61],"yield":[62],"more":[63],"or":[64],"less":[65],"exact":[66]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}