{"id":"https://openalex.org/W1612352339","doi":"https://doi.org/10.3217/jucs-003-03-0148","title":"Linear Time Simulation of Invertible Non-Deterministic Stack Algorithms","display_name":"Linear Time Simulation of Invertible Non-Deterministic Stack Algorithms","publication_year":2020,"publication_date":"2020-04-07","ids":{"openalex":"https://openalex.org/W1612352339","doi":"https://doi.org/10.3217/jucs-003-03-0148","mag":"1612352339"},"language":"en","primary_location":{"id":"pmh:oai:zenodo.org:6995342","is_oa":true,"landing_page_url":"https://zenodo.org/record/6995342","pdf_url":"https://zenodo.org/record/6995342","source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science 3((3)) 148-171","raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/6995342","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013326040","display_name":"N. Andersen","orcid":"https://orcid.org/0000-0002-9985-6444"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nils Andersen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5013326040"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00081271,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.8342999815940857,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.8342999815940857,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10601","display_name":"Handwritten Text Recognition Techniques","score":0.8220000267028809,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12707","display_name":"Vehicle License Plate Recognition","score":0.8093000054359436,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8805131912231445},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.7899540662765503},{"id":"https://openalex.org/keywords/invertible-matrix","display_name":"Invertible matrix","score":0.6885451078414917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5960437655448914},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4891234040260315},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32456251978874207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1031758189201355},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07597780227661133}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8805131912231445},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.7899540662765503},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.6885451078414917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5960437655448914},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4891234040260315},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32456251978874207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1031758189201355},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07597780227661133},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:zenodo.org:6995342","is_oa":true,"landing_page_url":"https://zenodo.org/record/6995342","pdf_url":"https://zenodo.org/record/6995342","source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science 3((3)) 148-171","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.109.5456","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.5456","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jukm.org/jucs_3_3/linear_time_simulation/Andersen_N.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/4b607f80-74cb-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/4b607f80-74cb-11db-bee9-02004c4f4f50","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Andersen , N 1997 , ' Linear Time Simulation of Invertible Non-Deterministic Stack Algorithms ' , Journal of Universal Computer Science , no. Vol.3, nr.3 , pp. 148-171 .","raw_type":"article"},{"id":"doi:10.3217/jucs-003-03-0148","is_oa":true,"landing_page_url":"https://doi.org/10.3217/jucs-003-03-0148","pdf_url":null,"source":{"id":"https://openalex.org/S4306400660","display_name":"TUGraz OPEN Library (Graz University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4092182","host_organization_name":"Graz University of Technology","host_organization_lineage":["https://openalex.org/I4092182"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"DataPaper"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:6995342","is_oa":true,"landing_page_url":"https://zenodo.org/record/6995342","pdf_url":"https://zenodo.org/record/6995342","source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JUCS - Journal of Universal Computer Science 3((3)) 148-171","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1612352339.pdf","grobid_xml":"https://content.openalex.org/works/W1612352339.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3155711473","https://openalex.org/W1970237106","https://openalex.org/W2064942708","https://openalex.org/W2005126103","https://openalex.org/W140552201","https://openalex.org/W2105490427","https://openalex.org/W305773953","https://openalex.org/W2789830491","https://openalex.org/W2043745003","https://openalex.org/W2287399337","https://openalex.org/W1974293217","https://openalex.org/W2027957526","https://openalex.org/W1967907744","https://openalex.org/W2149241928","https://openalex.org/W2117131623","https://openalex.org/W2272691688","https://openalex.org/W2185091998","https://openalex.org/W2110922591","https://openalex.org/W3036204904","https://openalex.org/W2461399954"],"abstract_inverted_index":{"Abstract:":[0],"It":[1,83],"is":[2,84],"demonstrated":[3],"how":[4],"a":[5,10,47,55,89,93,98,107,117],"program":[6,33,66,81,90,95],"making":[7,69],"use":[8,71],"of":[9,29,35,46,58,72,109],"single":[11],"stack":[12,74],"may":[13],"be":[14],"transformed,":[15],"via":[16],"memorization,":[17],"into":[18],"an":[19,62],"equivalent":[20],"one":[21],"running":[22],"in":[23,97,116],"time":[24,44],"proportional":[25],"to":[26,75,86,114],"the":[27,36,73,79],"sum":[28],"variabilities":[30,77],"at":[31,78],"certain":[32],"points":[34],"original":[37],"program.":[38,119],"This":[39],"result":[40],"generalizes":[41],"Cook's":[42,59],"linear":[43],"simulation":[45],"deterministic":[48],"two-way":[49],"push-down":[50],"automaton":[51],"and":[52,104],"also":[53],"provides":[54],"lucid":[56],"explanation":[57],"construction.":[60],"Obtaining":[61],"e":[63],"cient":[64],"transformed":[65],"depends":[67],"on":[68],"good":[70],"reduce":[76],"critical":[80],"points.":[82],"suggested":[85],"obtain":[87],"such":[88],"directly":[91],"from":[92],"source":[94],"expressed":[96],"non-deterministic":[99],"language":[100],"with":[101,106],"invertible":[102],"operations":[103],"annotated":[105],"kind":[108],"\\\\cuts":[110],"\"":[111],"somewhat":[112],"similar":[113],"cuts":[115],"Prolog":[118]},"counts_by_year":[],"updated_date":"2026-08-31T07:19:18.363097","created_date":"2016-06-24T00:00:00"}