{"id":"https://openalex.org/W4230442289","doi":"https://doi.org/10.1007/978-3-642-22321-1_10","title":"Theory of \u00c1tomata","display_name":"Theory of \u00c1tomata","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W4230442289","doi":"https://doi.org/10.1007/978-3-642-22321-1_10"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-22321-1_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22321-1_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5016883956","display_name":"Janusz Brzozowski","orcid":"https://orcid.org/0000-0003-3390-2767"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Janusz Brzozowski","raw_affiliation_strings":["David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada, N2L 3G1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada, N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079357690","display_name":"Hellis Tamm","orcid":"https://orcid.org/0000-0001-5446-3762"},"institutions":[{"id":"https://openalex.org/I111112146","display_name":"Tallinn University of Technology","ror":"https://ror.org/0443cwa12","country_code":"EE","type":"education","lineage":["https://openalex.org/I111112146"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Hellis Tamm","raw_affiliation_strings":["Institute of Cybernetics, Tallinn University of Technology, Akadeemia tee 21, 12618, Tallinn, Estonia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Cybernetics, Tallinn University of Technology, Akadeemia tee 21, 12618, Tallinn, Estonia","institution_ids":["https://openalex.org/I111112146"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.3192,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8872549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"105","last_page":"116"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9975000023841858,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9966999888420105,"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/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.7914721965789795},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.6442165970802307},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.634263277053833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6191065907478333},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5830820798873901},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.538813054561615},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5385599732398987},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5253159999847412},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5021638870239258},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4958518445491791},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.4688138961791992},{"id":"https://openalex.org/keywords/quotient","display_name":"Quotient","score":0.41434401273727417},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39477458596229553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3053792417049408},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3013961911201477},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2464022934436798},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2365666925907135},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1869814097881317},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.1735043227672577}],"concepts":[{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.7914721965789795},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.6442165970802307},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.634263277053833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6191065907478333},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5830820798873901},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.538813054561615},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5385599732398987},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5253159999847412},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5021638870239258},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4958518445491791},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.4688138961791992},{"id":"https://openalex.org/C199422724","wikidata":"https://www.wikidata.org/wiki/Q41118","display_name":"Quotient","level":2,"score":0.41434401273727417},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39477458596229553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3053792417049408},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3013961911201477},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2464022934436798},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2365666925907135},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1869814097881317},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1735043227672577}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-22321-1_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22321-1_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1570949334","https://openalex.org/W1588454361","https://openalex.org/W2054801208","https://openalex.org/W2061668791","https://openalex.org/W2073620032"],"related_works":["https://openalex.org/W2003664089","https://openalex.org/W2810776027","https://openalex.org/W1983100634","https://openalex.org/W63685668","https://openalex.org/W1990283467","https://openalex.org/W2408583837","https://openalex.org/W185868636","https://openalex.org/W2186499132","https://openalex.org/W2089404966","https://openalex.org/W1677349152"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}