{"id":"https://openalex.org/W200063938","doi":"https://doi.org/10.1007/978-1-4612-0289-9","title":"Finite Automata, Formal Logic, and Circuit Complexity","display_name":"Finite Automata, Formal Logic, and Circuit Complexity","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W200063938","doi":"https://doi.org/10.1007/978-1-4612-0289-9","mag":"200063938"},"language":"en","primary_location":{"id":"doi:10.1007/978-1-4612-0289-9","doi":"https://doi.org/10.1007/978-1-4612-0289-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4612-0289-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306462921","display_name":"Birkh\u00e4user Boston eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"book"},"volume":null,"type":"book","is_traditional":true,"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/A5084561937","display_name":"Howard Straubing C","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Howard Straubing","raw_affiliation_strings":["Computer Science Department, Boston College, Chestnut Hill, USA","Boston College Chestnut Hill MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Boston College, Chestnut Hill, USA","institution_ids":["https://openalex.org/I103531236"]},{"raw_affiliation_string":"Boston College Chestnut Hill MA","institution_ids":["https://openalex.org/I103531236"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084561937"],"corresponding_institution_ids":["https://openalex.org/I103531236"],"apc_list":null,"apc_paid":null,"fwci":2.2198,"has_fulltext":false,"cited_by_count":418,"citation_normalized_percentile":{"value":0.90243902,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9932000041007996,"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":0.9932000041007996,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.005400000140070915,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0003000000142492354,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/finite-state-machines","display_name":"finite automata","score":0.9990000128746033},{"id":"https://openalex.org/keywords/formal-logic","display_name":"formal logic","score":0.9810000061988831},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"circuit complexity","score":0.9900000095367432},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.5920000076293945},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.38999998569488525}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6010112166404724},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5564332604408264},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.49634963274002075},{"id":"https://openalex.org/C2777855551","wikidata":"https://www.wikidata.org/wiki/Q12310021","display_name":"Subject (documents)","level":2,"score":0.4514176845550537},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44140705466270447},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.4311264157295227},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.42677533626556396},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3121738135814667},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-1-4612-0289-9","doi":"https://doi.org/10.1007/978-1-4612-0289-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4612-0289-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306462921","display_name":"Birkh\u00e4user Boston eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"book"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-006384716","doi":null,"is_oa":false,"landing_page_url":"http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006384716&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1856929792","https://openalex.org/W2502103274","https://openalex.org/W6922565806","https://openalex.org/W4247522139","https://openalex.org/W23085724","https://openalex.org/W1563461880","https://openalex.org/W2618060913","https://openalex.org/W184309812","https://openalex.org/W1523241346","https://openalex.org/W4240881797"],"abstract_inverted_index":{"The":[0],"study":[1],"of":[2,24],"the":[3,21,25],"connections":[4],"between":[5],"mathematical":[6],"automata":[7],"and":[8],"for":[9],"mal":[10],"logic":[11],"is":[12],"as":[13,15],"old":[14],"theoretical":[16],"computer":[17],"science":[18],"itself.":[19],"In":[20],"founding":[22],"paper":[23],"subject,":[26],"published":[27],"in":[28],"1936,":[29],"Turing":[30],"showed":[31],"ho":[32]},"counts_by_year":[{"year":2026,"cited_by_count":6},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":21},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":21}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}