A Type System Describing Unboundedness

We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that allows to solve the simultaneous-unboundedness problem (SUP) for schemes, which asks, given a set of letters A and a scheme G, whether it is the case...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Discrete Mathematics and Theoretical Computer Science Ročník 22 no. 4; číslo Automata, Logic and Semantics; s. 1 - 84
Hlavný autor: Parys, Paweł
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Nancy DMTCS 01.08.2020
Discrete Mathematics & Theoretical Computer Science
Predmet:
[info.info-cc]computer science [cs]/computational complexity [cs.cc]
[info.info-fl]computer science [cs]/formal languages and automata theory [cs.fl]
[info.info-lo]computer science [cs]/logic in computer science [cs.lo]
Computational Complexity
Computer Science
Finite sets
Formal Languages and Automata Theory
higher-order recursion schemes
intersection types
Logic in Computer Science
Mathematical research
Recursive functions
reflection
simultaneous-unboundedness problem
Trees (Graph theory)
Words (language)
Poland
intersection types
simultaneous-unboundedness problem
higher-order recursion schemes
reflection
ISSN:1365-8050, 1462-7264, 1365-8050
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that allows to solve the simultaneous-unboundedness problem (SUP) for schemes, which asks, given a set of letters A and a scheme G, whether it is the case that for every number n the scheme accepts a word (a tree) in which every letter from A appears at least n times. Using this type system we prove that SUP is (m-1)-EXPTIME-complete for word-recognizing schemes of order m, and m-EXPTIME-complete for tree-recognizing schemes of order m. Moreover, we establish the reflection property for SUP: out of an input scheme G one can create its enhanced version that recognizes the same language but is aware of the answer to SUP.
AbstractList We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that allows to solve the simultaneous-unboundedness problem (SUP) for schemes, which asks, given a set of letters A and a scheme G, whether it is the case that for every number n the scheme accepts a word (a tree) in which every letter from A appears at least n times. Using this type system we prove that SUP is (m-1)-EXPTIME-complete for word-recognizing schemes of order m, and m-EXPTIME-complete for tree-recognizing schemes of order m. Moreover, we establish the reflection property for SUP: out of an input scheme G one can create its enhanced version that recognizes the same language but is aware of the answer to SUP.
Audience Academic
Author Parys, Paweł
Author_xml – sequence: 1
  givenname: Paweł
  orcidid: 0000-0001-7247-1408
  surname: Parys
  fullname: Parys, Paweł
BackLink https://hal.science/hal-01850934$$DView record in HAL
BookMark eNptkUtLAzEUhYMoaNWl-wFBcDGa98wsS-sLKi5s1yGT3Kkp7aQmU6H_3rQjUkGySDh893BPzgAdt74FhK4IvqNMsvJ-_DodveeU5jynR-iMMCnyEgt8fPA-RYMYFxgTWvHiDN0Ms-l2Ddn7NnawysYQTXC1a-fZrK39prVgW4jxAp00ehnh8uc-R7PHh-noOZ-8Pb2MhpPccFp0OakbEJaXBAtiamZJXYmqlIWxQDRhAjDhttBSS8xAVNQQoUXJtQWpMasKdo5eel_r9UKtg1vpsFVeO7UXfJgrHTpnlqBKrMEkJ1KTmjMqK1EXTNOiwpQCyJ3Xbe_1oZd_rJ6HE7XTMCkFrhj_4om97tl18J8biJ1a-E1oU1TFcMoj0mcdUHOdFnBt47ugzcpFo4aSp8yJJYm6-4dKx8LKmVRZ45L-ZyDvB0zwMQZofrclWO2bVftmFaWKJ-EbNz6SLg
ContentType Journal Article
Copyright COPYRIGHT 2020 DMTCS
Copyright DMTCS 2020
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: COPYRIGHT 2020 DMTCS
– notice: Copyright DMTCS 2020
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BFMQW
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
1XC
VOOES
DOA
DOI 10.23638/DMTCS-22-4-2
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
Continental Europe Database
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering collection
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
Continental Europe Database
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList CrossRef

Publicly Available Content Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: ProQuest Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1365-8050
EndPage 84
ExternalDocumentID oai_doaj_org_article_80aec6a61b1b432695b73a279022ee67
oai:HAL:hal-01850934v4
A640513041
10_23638_DMTCS_22_4_2
Genre Feature
GeographicLocations Poland
GeographicLocations_xml – name: Poland
GroupedDBID -~9
.4S
.DC
29G
2WC
5GY
5VS
8FE
8FG
AAFWJ
AAYXX
ABDBF
ABJCF
ABUWG
ACGFO
ACIWK
ACUHS
ADBBV
ADQAK
AENEX
AFFHD
AFKRA
AFPKN
AIAGR
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARCSS
B0M
BAIFH
BBTPI
BCNDV
BENPR
BFMQW
BGLVJ
BPHCQ
CCPQU
CITATION
EAP
EBS
ECS
EDO
EJD
EMK
EPL
EST
ESX
GROUPED_DOAJ
HCIFZ
I-F
IAO
IBB
ICD
ITC
J9A
KQ8
KWQ
L6V
M7S
MK~
ML~
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
PV9
REM
RNS
RSU
RZL
TR2
TUS
XSB
~8M
M~E
ADOJU
AZQEC
DWQXO
PKEHL
PQEST
PQUKI
PRINS
PUEGO
1XC
VOOES
ID FETCH-LOGICAL-c427t-1bfe5d481051cb3d1b959867cde1a135e014d7a6a603e592c15a584ade6a03973
IEDL.DBID DOA
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000563434400004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1365-8050
1462-7264
IngestDate Mon Nov 10 04:31:49 EST 2025
Tue Oct 14 20:31:47 EDT 2025
Sat Aug 23 14:15:50 EDT 2025
Tue Mar 18 23:28:23 EDT 2025
Sat Mar 08 18:34:42 EST 2025
Sat Nov 29 08:04:39 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue Automata, Logic and Semantics
Keywords intersection types
simultaneous-unboundedness problem
higher-order recursion schemes
reflection
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c427t-1bfe5d481051cb3d1b959867cde1a135e014d7a6a603e592c15a584ade6a03973
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ORCID 0000-0001-7247-1408
OpenAccessLink https://doaj.org/article/80aec6a61b1b432695b73a279022ee67
PQID 3048159474
PQPubID 946337
PageCount 84
ParticipantIDs doaj_primary_oai_doaj_org_article_80aec6a61b1b432695b73a279022ee67
hal_primary_oai_HAL_hal_01850934v4
proquest_journals_3048159474
gale_infotracmisc_A640513041
gale_infotracacademiconefile_A640513041
crossref_primary_10_23638_DMTCS_22_4_2
PublicationCentury 2000
PublicationDate 20200801
PublicationDateYYYYMMDD 2020-08-01
PublicationDate_xml – month: 08
  year: 2020
  text: 20200801
  day: 01
PublicationDecade 2020
PublicationPlace Nancy
PublicationPlace_xml – name: Nancy
PublicationTitle Discrete Mathematics and Theoretical Computer Science
PublicationYear 2020
Publisher DMTCS
Discrete Mathematics & Theoretical Computer Science
Publisher_xml – name: DMTCS
– name: Discrete Mathematics & Theoretical Computer Science
SSID ssj0012947
ssib044734695
Score 2.2054348
Snippet We consider nondeterministic higher-order recursion schemes as recognizers of languages of finite words or finite trees. We propose a type system that allows...
SourceID doaj
hal
proquest
gale
crossref
SourceType Open Website
Open Access Repository
Aggregation Database
Index Database
StartPage 1
SubjectTerms [info.info-cc]computer science [cs]/computational complexity [cs.cc]
[info.info-fl]computer science [cs]/formal languages and automata theory [cs.fl]
[info.info-lo]computer science [cs]/logic in computer science [cs.lo]
Computational Complexity
Computer Science
Finite sets
Formal Languages and Automata Theory
higher-order recursion schemes
intersection types
Logic in Computer Science
Mathematical research
Recursive functions
reflection
simultaneous-unboundedness problem
Trees (Graph theory)
Words (language)
SummonAdditionalLinks – databaseName: ProQuest Central
  dbid: BENPR
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LTxsxEB5B6KEcCqWtSJtWK4ToyWL9WHt9qgIFcYAIFZC4WX4t7SWhScrv79hxgsKhl15trzTreXg-P74BOKTUci2jI4IzTgTzLbFC1aTtpNSd75wXPhebUKNRe3-vr8uG26xcq1zGxByow8SnPfJjnolNtFDi2-NvkqpGpdPVUkJjE7YSU5nowdbJ2ej6x-ocgeEHC2ZNxtHSjr9f3Z7eEMRfgrC1lSgT9q_C8ubPdCvyRXDOK875zv_KugtvSq5ZDRfG8RY24ngPdpZ1HKri1nuwfbXibp29g6NhlcBpteAyrxCYYmBB_PxQ3Y1dKsIUQwqP7-Hu_Oz29IKUagrEC6bmhLouNgEFQzf0jgfqdOJmVz5EailvIoKloKy0suax0czTxmJ2YkOUtsashX-A3ngyjvtQUR9U57qgpIzpRNn5xrW-9thsdSNEH46WM2seF6QZBsFGVoHJKjCMGWFYH07SvK8GJa7r3DCZPpjiOqatbfQoFnXUoUVJ3TjFLVMa048YperD16Q1kzxyPrXelocFKGvitjJDiUkpLtWC9mGwNhI9ya91H6De14S5GF6a1FZjWlNrLp7w3wZLnZvi7jPzrPCP_-7-BK9ZAuz5BuEAevPpn_gZXvmn-a_Z9Eux3r_dhPXO
  priority: 102
  providerName: ProQuest
Title A Type System Describing Unboundedness
URI https://www.proquest.com/docview/3048159474
https://hal.science/hal-01850934
https://doaj.org/article/80aec6a61b1b432695b73a279022ee67
Volume 22 no. 4
WOSCitedRecordID wos000563434400004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: DOA
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044734695
  issn: 1365-8050
  databaseCode: M~E
  dateStart: 19980101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Continental Europe Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BFMQW
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/conteurope
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: M7S
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Publicly Available Content Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: PIMPY
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LTxsxEB4V2gM90PKoCKTRClVwslg_1l4fAw2iEokiHhKcLNvrpb2kKEk58tsZezcR4cKllz3Y1sqe8Yznk8ffAPyg1HItgyOCM04E8yWxQuWkrKXUta-dFz4Vm1CjUXl3p8evSn3FnLCGHrgR3EmZ2-ClldRRh_-TunCKW6Y0Hj4hyPSOHKOeBZhq7w-YFqph1GQcd9jJz-HN2TVB3CUIWzmBElH_0h2v_Y7ZkG-ccjppzr_CZhsiZv1malvwIUy24cui_ELWWuM2fB4uKVdnO3DUzyKmzBoK8gzxJPoDhL0P2e3ExdpJoYpebRduzwc3ZxekLYJAvGBqTqirQ1GJEuMg6h2vqNORUl35KlBLeREQ41TKooRyHgrNPC0sBhW2CtLmGGzwb7A--TsJe5BRX6na1ZWSMsSLYOcLV_rcY7PVhRAdOFoIxjw2XBcGMUKSoEkSNIwZYVgHTqPYloMiRXVqQMWZVnHmPcV14DgK3URDmk-tt-17AJxrpKQyfYmxJJ6wgnaguzISDcCvdB-i2lYmc9G_NLEtx2gk11w84dq6C62a1kpnhieyHNwqYv9_rOgANlhE4yk9sAvr8-m_8B0--af5n9m0Bx9PB6PxVS9t1F7MMb2O3-cB9ox_Dcf3L5is6xw
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NbxMxEB21BQk4UCggAgFWCMrJ6vpj7fUBodBSpWoSITWVejO21wtckpKEIv4Uv5GxdzcoHLj1wNW2rNmd5zceezwD8IpSy7UMjgjOOBHMl8QKlZOyllLXvnZe-FRsQk0m5cWF_rgFv7q3MDGssuPERNTV3Mcz8gOeEptoocS7y28kVo2Kt6tdCY0GFqfh5w902ZZvT45Qv68ZO_4wPRyStqoA8YKpFaGuDkWFkyEcveMVdTrmKFe-CtRSXgR0GiplpZU5D4VmnhYWrbStgrQ5Wm-O827DDRHZP4UKnq1vLRiK1-TxZBxxfXA0nh6eEfT2BGEbdi-VB1gbge0vMQbzL1OQ7Nvx7v_2Z-7B3XYnnQ0a6N-HrTDbg92uSkXWktYe3BmvM9MuH8D-IIuud9Zkas_Q7UbadGi_s_OZiyWmQhXJ_yGcX4vsj2BnNp-Fx5BRX6na1ZWSMsT7cucLV_rcY7PVhRA92O80aS6blCAGXamkcpNUbhgzwrAevI96Xg-KmbxTw3zx2bTEYMrcBo9iUUcdrhepC6e4ZUrj5ioEqXrwJqLERL5ZLay37bMJlDVm7jIDiVtuhKKgPehvjESe8BvdLxFnG8IMByMT23LctOWaiyv8tn6HMdOS2dL8AdiTf3e_gFvD6XhkRieT06dwm8WjiRQr2Yed1eJ7eAY3_dXq63LxPK2bDD5dNxx_A3TzUHM
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Type+System+Describing+Unboundedness&rft.jtitle=Discrete+mathematics+and+theoretical+computer+science&rft.au=Parys%2C+Pawe%C5%82&rft.date=2020-08-01&rft.issn=1365-8050&rft.eissn=1365-8050&rft.volume=22+no.+4&rft.issue=Automata%2C+Logic+and+Semantics&rft_id=info:doi/10.23638%2FDMTCS-22-4-2&rft.externalDBID=n%2Fa&rft.externalDocID=10_23638_DMTCS_22_4_2
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon