{"id":"https://openalex.org/W4214657356","doi":"https://doi.org/10.1142/s0218196722500230","title":"Rational, recognizable, and aperiodic partially lossy queue languages","display_name":"Rational, recognizable, and aperiodic partially lossy queue languages","publication_year":2022,"publication_date":"2022-02-24","ids":{"openalex":"https://openalex.org/W4214657356","doi":"https://doi.org/10.1142/s0218196722500230"},"language":"en","primary_location":{"id":"doi:10.1142/s0218196722500230","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218196722500230","pdf_url":null,"source":{"id":"https://openalex.org/S23260266","display_name":"International Journal of Algebra and Computation","issn_l":"0218-1967","issn":["0218-1967","1793-6500"],"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 Algebra and Computation","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/A5029292910","display_name":"Chris K\u00f6cher","orcid":"https://orcid.org/0000-0003-4575-9339"},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Chris K\u00f6cher","raw_affiliation_strings":["Automata and Logics Group, Technische Universit\u00e4t Ilmenau, P. O. Box 10 05 65, 98684 Ilmenau, Germany"],"affiliations":[{"raw_affiliation_string":"Automata and Logics Group, Technische Universit\u00e4t Ilmenau, P. O. Box 10 05 65, 98684 Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029292910"],"corresponding_institution_ids":["https://openalex.org/I119449181"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03659549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"03","first_page":"483","last_page":"528"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9955000281333923,"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.9954000115394592,"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/monoid","display_name":"Monoid","score":0.7652959227561951},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6969141960144043},{"id":"https://openalex.org/keywords/aperiodic-graph","display_name":"Aperiodic graph","score":0.6753682494163513},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6248642206192017},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.5259878039360046},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.5235654711723328},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48476332426071167},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.454424649477005},{"id":"https://openalex.org/keywords/commutative-property","display_name":"Commutative property","score":0.4422603249549866},{"id":"https://openalex.org/keywords/syntactic-monoid","display_name":"Syntactic monoid","score":0.4129425585269928},{"id":"https://openalex.org/keywords/free-monoid","display_name":"Free monoid","score":0.3819926083087921},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32175859808921814},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24693763256072998},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16071277856826782},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.08323264122009277}],"concepts":[{"id":"https://openalex.org/C206901836","wikidata":"https://www.wikidata.org/wiki/Q208237","display_name":"Monoid","level":2,"score":0.7652959227561951},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6969141960144043},{"id":"https://openalex.org/C104247578","wikidata":"https://www.wikidata.org/wiki/Q4779368","display_name":"Aperiodic graph","level":2,"score":0.6753682494163513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6248642206192017},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.5259878039360046},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.5235654711723328},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48476332426071167},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.454424649477005},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.4422603249549866},{"id":"https://openalex.org/C119903167","wikidata":"https://www.wikidata.org/wiki/Q3321297","display_name":"Syntactic monoid","level":4,"score":0.4129425585269928},{"id":"https://openalex.org/C149685015","wikidata":"https://www.wikidata.org/wiki/Q5500266","display_name":"Free monoid","level":3,"score":0.3819926083087921},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32175859808921814},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24693763256072998},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16071277856826782},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.08323264122009277},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218196722500230","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218196722500230","pdf_url":null,"source":{"id":"https://openalex.org/S23260266","display_name":"International Journal of Algebra and Computation","issn_l":"0218-1967","issn":["0218-1967","1793-6500"],"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 Algebra and Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1489366126","https://openalex.org/W1505482284","https://openalex.org/W1520896816","https://openalex.org/W1562651735","https://openalex.org/W1569565139","https://openalex.org/W1586417893","https://openalex.org/W1816620374","https://openalex.org/W1973267299","https://openalex.org/W1980330971","https://openalex.org/W1985925577","https://openalex.org/W1987017691","https://openalex.org/W1989887898","https://openalex.org/W2010175469","https://openalex.org/W2013085432","https://openalex.org/W2025970201","https://openalex.org/W2035413543","https://openalex.org/W2078567245","https://openalex.org/W2116250539","https://openalex.org/W2116976042","https://openalex.org/W2123160677","https://openalex.org/W2884354591","https://openalex.org/W3022103681","https://openalex.org/W4205178514"],"related_works":["https://openalex.org/W51936586","https://openalex.org/W3161268522","https://openalex.org/W3143205136","https://openalex.org/W2071633178","https://openalex.org/W2971508078","https://openalex.org/W2038387119","https://openalex.org/W3201418638","https://openalex.org/W2090238248","https://openalex.org/W1511851241","https://openalex.org/W1604222671"],"abstract_inverted_index":{"Partially":[0],"lossy":[1,31],"queue":[2,32],"monoids":[3],"(plq":[4,34],"monoids)":[5],"model":[6],"the":[7,25,52,61,75,78,95,105,128,138,144],"behavior":[8],"of":[9,17,27,47,63,80,104,111,140],"queues":[10],"that":[11,77],"can":[12,93,121],"non-deterministically":[13],"forget":[14],"specified":[15],"parts":[16],"their":[18],"content":[19],"at":[20],"any":[21],"time.":[22],"We":[23],"call":[24],"subsets":[26],"this":[28,59],"monoid":[29,60],"partially":[30],"languages":[33,43,53,67,83,98,142],"languages).":[35],"While":[36],"many":[37],"decision":[38],"problems":[39],"on":[40],"recognizable":[41,66,81,96,129],"plq":[42,82,97,130,145],"are":[44,49,54],"decidable,":[45],"most":[46],"them":[48],"undecidable":[50],"if":[51],"rational.":[55],"In":[56],"particular,":[57],"in":[58,143],"classes":[62],"rational":[64,101,118],"and":[65,89,108,113],"do":[68],"not":[69,85],"coincide.":[70],"This":[71],"is":[72,84],"due":[73],"to":[74],"fact":[76],"class":[79,139],"closed":[86],"under":[87],"multiplication":[88,112],"iteration.":[90,114],"However,":[91],"we":[92,120,133],"generate":[94],"using":[99],"special":[100,117],"expressions":[102,119],"consisting":[103],"Boolean":[106],"operations":[107],"restricted":[109],"versions":[110],"From":[115],"these":[116],"also":[122],"obtain":[123],"an":[124],"MSO":[125],"logic":[126],"describing":[127],"languages.":[131],"Moreover,":[132],"provide":[134],"similar":[135],"results":[136],"for":[137],"aperiodic":[141],"monoid.":[146]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}