{"id":"https://openalex.org/W2406828714","doi":"https://doi.org/10.1201/b13055-13","title":"Incremental Construction of Finite-State Automata","display_name":"Incremental Construction of Finite-State Automata","publication_year":2012,"publication_date":"2012-11-29","ids":{"openalex":"https://openalex.org/W2406828714","doi":"https://doi.org/10.1201/b13055-13","mag":"2406828714"},"language":"en","primary_location":{"id":"doi:10.1201/b13055-13","is_oa":false,"landing_page_url":"https://doi.org/10.1201/b13055-13","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Finite State Based Models and Applications","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/A5004158565","display_name":"Jan Daciuk","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jan Daciuk","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004158565"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.24702014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"183","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9990000128746033,"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.9990000128746033,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9926999807357788,"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/T10142","display_name":"Formal Methods in Verification","score":0.991100013256073,"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-machine","display_name":"Finite-state machine","score":0.6120619773864746},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5667834877967834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5575912594795227},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4348088502883911},{"id":"https://openalex.org/keywords/finite-state","display_name":"Finite state","score":0.41090816259384155},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.27015912532806396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2661454677581787},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.040955424308776855}],"concepts":[{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.6120619773864746},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5667834877967834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5575912594795227},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4348088502883911},{"id":"https://openalex.org/C2983497884","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite state","level":3,"score":0.41090816259384155},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27015912532806396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2661454677581787},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.040955424308776855},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1201/b13055-13","is_oa":false,"landing_page_url":"https://doi.org/10.1201/b13055-13","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Finite State Based Models and Applications","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":0,"referenced_works":[],"related_works":["https://openalex.org/W1532285316","https://openalex.org/W4281261571","https://openalex.org/W4387024110","https://openalex.org/W127357700","https://openalex.org/W2535494882","https://openalex.org/W1480528870","https://openalex.org/W2508541108","https://openalex.org/W2315419748","https://openalex.org/W4387581576","https://openalex.org/W4254987752"],"abstract_inverted_index":{"Among":[0],"finite-state":[1],"automata,":[2],"acyclic":[3,38],"automata":[4,51,64],"play":[5],"an":[6,37],"important":[7],"role":[8],"inmany":[9],"applications.":[10],"For":[11],"example,":[12],"they":[13,55],"are":[14,52,65],"often":[15],"used":[16,53],"as":[17,29,31,54],"dictionaries":[18],"in":[19],"natural":[20],"language":[21,35],"processing":[22],"and":[23],"computational":[24],"linguistics":[25],"(including":[26],"speech":[27],"processing),":[28],"well":[30],"compiler":[32],"construction.":[33],"A":[34],"of":[36,44],"automaton":[39],"is":[40],"a":[41],"finite":[42],"set":[43],"finite-length":[45],"strings.":[46],"To":[47,60],"speed-up":[48],"processing,":[49],"deterministic":[50],"do":[56],"not":[57],"require":[58],"backtracking.":[59],"save":[61],"space,":[62],"the":[63],"minimal.":[66]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}