{"id":"https://openalex.org/W3165290558","doi":"https://doi.org/10.46298/lmcs-19(4:36)2023","title":"Decision Questions for Probabilistic Automata on Small Alphabets","display_name":"Decision Questions for Probabilistic Automata on Small Alphabets","publication_year":2023,"publication_date":"2023-12-21","ids":{"openalex":"https://openalex.org/W3165290558","doi":"https://doi.org/10.46298/lmcs-19(4:36)2023","mag":"3165290558"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-19(4:36)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(4:36)2023","pdf_url":"https://lmcs.episciences.org/12731/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/12731/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077382166","display_name":"Paul C. Bell","orcid":"https://orcid.org/0000-0003-2620-635X"},"institutions":[{"id":"https://openalex.org/I56007636","display_name":"Keele University","ror":"https://ror.org/00340yn33","country_code":"GB","type":"education","lineage":["https://openalex.org/I56007636"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paul C. Bell","raw_affiliation_strings":["Keele University, School of Computer Science and Mathematics, Colin Reeves Building, Keele, Staffordshire, ST5 5BG, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Keele University, School of Computer Science and Mathematics, Colin Reeves Building, Keele, Staffordshire, ST5 5BG, UK","institution_ids":["https://openalex.org/I56007636"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050813521","display_name":"Pavel Semukhin","orcid":"https://orcid.org/0000-0002-7547-6391"},"institutions":[{"id":"https://openalex.org/I63098007","display_name":"Liverpool John Moores University","ror":"https://ror.org/04zfme737","country_code":"GB","type":"education","lineage":["https://openalex.org/I63098007"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Pavel Semukhin","raw_affiliation_strings":["Liverpool John Moores University, School of Computer Science and Mathematics, James Parsons Building, Byrom Street, Liverpool, L3 3AF, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Liverpool John Moores University, School of Computer Science and Mathematics, James Parsons Building, Byrom Street, Liverpool, L3 3AF, UK","institution_ids":["https://openalex.org/I63098007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1863,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48318124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"Volume 19, Issue 4","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.9998999834060669,"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.9998999834060669,"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.9993000030517578,"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.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.8427853584289551},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7319252490997314},{"id":"https://openalex.org/keywords/emptiness","display_name":"Emptiness","score":0.716810405254364},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5996431112289429},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5970644950866699},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5442798733711243},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.5185654759407043},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.47187748551368713},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4244453012943268},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.40533447265625},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.22743582725524902},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17532271146774292},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11766961216926575}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8427853584289551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7319252490997314},{"id":"https://openalex.org/C2779150620","wikidata":"https://www.wikidata.org/wiki/Q1096367","display_name":"Emptiness","level":2,"score":0.716810405254364},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5996431112289429},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5970644950866699},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5442798733711243},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.5185654759407043},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.47187748551368713},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4244453012943268},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.40533447265625},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.22743582725524902},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17532271146774292},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11766961216926575},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.46298/lmcs-19(4:36)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(4:36)2023","pdf_url":"https://lmcs.episciences.org/12731/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2105.10293","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2105.10293","pdf_url":"https://arxiv.org/pdf/2105.10293","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:researchonline.ljmu.ac.uk:23959","is_oa":true,"landing_page_url":"https://orcid.org/0000-0002-7547-6391","pdf_url":"https://researchonline.ljmu.ac.uk/id/eprint/23959/1/DECISION%20QUESTIONS%20FOR%20PROBABILISTIC%20AUTOMATA%20ON%20SMALL%20ALPHABETS.pdf","source":{"id":"https://openalex.org/S4306401246","display_name":"Liverpool John Moores University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63098007","host_organization_name":"Liverpool John Moores University","host_organization_lineage":["https://openalex.org/I63098007"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:doaj.org/article:a6c557d953c24dd786d8f26d8cfc350c","is_oa":true,"landing_page_url":"https://doaj.org/article/a6c557d953c24dd786d8f26d8cfc350c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)","raw_type":"article"},{"id":"doi:10.4230/lipics.mfcs.2021.15","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2021.15","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.46298/lmcs-19(4:36)2023","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-19(4:36)2023","pdf_url":"https://lmcs.episciences.org/12731/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3165290558.pdf"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W3371211","https://openalex.org/W104993865","https://openalex.org/W177913229","https://openalex.org/W1488435683","https://openalex.org/W1537561239","https://openalex.org/W1570445666","https://openalex.org/W1574229394","https://openalex.org/W1598450631","https://openalex.org/W1728602962","https://openalex.org/W1797219784","https://openalex.org/W2006083528","https://openalex.org/W2031206336","https://openalex.org/W2049055375","https://openalex.org/W2072102045","https://openalex.org/W2114554615","https://openalex.org/W2302908626","https://openalex.org/W2759353025","https://openalex.org/W2798684825","https://openalex.org/W2915637607","https://openalex.org/W2963995757","https://openalex.org/W2965171763","https://openalex.org/W2968034306","https://openalex.org/W3013335592","https://openalex.org/W3024727471","https://openalex.org/W3082263294","https://openalex.org/W3165290558","https://openalex.org/W4212875940","https://openalex.org/W4213009134","https://openalex.org/W4213269876","https://openalex.org/W4231938090","https://openalex.org/W4236196594","https://openalex.org/W4287178547","https://openalex.org/W4287866962","https://openalex.org/W4288562463","https://openalex.org/W4367558796","https://openalex.org/W6666216516","https://openalex.org/W6677469665","https://openalex.org/W6744770565","https://openalex.org/W6767053180"],"related_works":["https://openalex.org/W1554767603","https://openalex.org/W2130664212","https://openalex.org/W1565729639","https://openalex.org/W4382045631","https://openalex.org/W2533032519","https://openalex.org/W4386700062","https://openalex.org/W2058117339","https://openalex.org/W1676886548","https://openalex.org/W3030465535","https://openalex.org/W2260250184"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,17,25,30,33,59,73,76,114],"emptiness":[3,43,79,119,124],"and":[4,9,15,32,44,55,78,106,122],"$\\lambda$-reachability":[5,45,77,115],"problems":[6,21,80,90],"for":[7,50,81,94],"unary":[8,53,84,97],"binary":[10,100],"Probabilistic":[11],"Finite":[12],"Automata":[13],"(PFA)":[14],"characterise":[16],"complexity":[18],"of":[19,24,27,29,35,75,113],"these":[20,89],"in":[22,48,57,68],"terms":[23],"degree":[26],"ambiguity":[28],"automaton":[31],"size":[34],"its":[36],"alphabet.":[37],"Our":[38],"main":[39],"result":[40],"is":[41,62],"that":[42,88],"are":[46,67,91],"solvable":[47],"EXPTIME":[49],"polynomially":[51,101],"ambiguous":[52,83,96,102],"PFA":[54,103],"if,":[56],"addition,":[58],"transition":[60,108],"matrix":[61],"binary,":[63],"we":[64,86,110],"show":[65,87],"they":[66],"NP.":[69],"In":[70],"contrast":[71],"to":[72],"Skolem-hardness":[74],"exponentially":[82],"PFA,":[85],"NP-hard":[92],"even":[93],"finitely":[95],"PFA.":[98],"For":[99],"with":[104],"fixed":[105],"commuting":[107],"matrices,":[109],"prove":[111],"NP-hardness":[112],"(dimension":[116,120,125],"9),":[117],"nonstrict":[118],"37)":[121],"strict":[123],"40)":[126],"problems.":[127]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}