Parameterized complexity of basic decision problems for tree automata

There are many decision problems in automata theory (including membership, emptiness, inclusion and universality problems) that are NP-hard for some classes of tree automata (TA). The study of their parameterized complexity allows us to find new bounds of their nonpolynomial time algorithmic behavio...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of computer mathematics Ročník 90; číslo 6; s. 1150 - 1170
Hlavní autoři: Charatonik, Witold, Chorowska, Agata
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Taylor & Francis 01.06.2013
Taylor & Francis Ltd
Témata:
Algorithms
Automation
classical tree automata
Complexity
Computer science
Mathematical analysis
Mathematical models
Parameter estimation
parameterized complexity theory
rigid tree automata
Signatures
t-DAG automata
Tantalum
Theory
tree automata with global equality and disequality
Trees
ISSN:0020-7160, 1029-0265
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract There are many decision problems in automata theory (including membership, emptiness, inclusion and universality problems) that are NP-hard for some classes of tree automata (TA). The study of their parameterized complexity allows us to find new bounds of their nonpolynomial time algorithmic behaviours. We present results of such a study for classical TA, rigid tree automata, TA with global equality and disequality and t-DAG automata. As parameters we consider the number of states, the cardinality of the signature, the size of the term or the t-dag and the size of the automaton.
AbstractList There are many decision problems in automata theory (including membership, emptiness, inclusion and universality problems) that are NP-hard for some classes of tree automata (TA). The study of their parameterized complexity allows us to find new bounds of their nonpolynomial time algorithmic behaviours. We present results of such a study for classical TA, rigid tree automata, TA with global equality and disequality and t-DAG automata. As parameters we consider the number of states, the cardinality of the signature, the size of the term or the t-dag and the size of the automaton. [PUBLICATION ABSTRACT]
There are many decision problems in automata theory (including membership, emptiness, inclusion and universality problems) that are NP-hard for some classes of tree automata (TA). The study of their parameterized complexity allows us to find new bounds of their nonpolynomial time algorithmic behaviours. We present results of such a study for classical TA, rigid tree automata, TA with global equality and disequality and t-DAG automata. As parameters we consider the number of states, the cardinality of the signature, the size of the term or the t-dag and the size of the automaton.
Author Charatonik, Witold
Chorowska, Agata
Author_xml – sequence: 1
  givenname: Witold
  surname: Charatonik
  fullname: Charatonik, Witold
  organization: Institute of Computer Science , University of Wrocław
– sequence: 2
  givenname: Agata
  surname: Chorowska
  fullname: Chorowska, Agata
  email: agata.chorowsk@gmail.com
  organization: Mathematical Institute , University of Wrocław
BookMark eNqFkUtLxDAUhYMoOKP-AxcFN246JmmStm5ExBcIutB1uM0DMrTNmGTQ8debMrpx4awuXL5zuPecOdof_WgQOiV4QXCDLzCmuCYCLygmdFELyjjZQzOCaVtiKvg-mk1IOTGHaB7jEmPctLWYodsXCDCYZIL7MrpQflj15tOlTeFt0UF0qtBGuej8WKyC73ozxML6UKRgTAHr5AdIcIwOLPTRnPzMI_R2d_t681A-Pd8_3lw_lYphkkpSGVZr4PmMVotKdBzyRuu6U5YxTrlVwBhV3Ki2IQJIq6zSgtmOtbrSvDpC51vffMr72sQkBxeV6XsYjV9HSURNeCNoS3ajjNQ5AsYn17M_6NKvw5gfkaSqKRMNFVWmLreUCj7GYKxULkHKwaQArpcEy6kM-VuGnMqQ2zKymP0Rr4IbIGx2ya62MjfmzAf48KHXMsGm98EGGHMxsvrX4Ru5saEC
CitedBy_id crossref_primary_10_1007_s11704_016_5128_z
crossref_primary_10_1007_s11704_014_3425_y
crossref_primary_10_1080_00207160_2013_808829
Cites_doi 10.1007/3-540-44674-5_26
10.1007/978-1-4612-0515-9
10.1016/S0167-6423(02)00132-6
10.1109/LICS.2010.28
10.1007/978-3-642-00982-2_38
10.1007/BFb0032738
10.1145/318593.318622
10.1007/978-3-642-21254-3_9
10.1016/j.ipl.2005.02.004
10.1142/S012905411000743X
10.1007/3-540-45127-7_16
10.1016/j.jcss.2006.10.003
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2013
Copyright Taylor & Francis Ltd. 2013
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2013
– notice: Copyright Taylor & Francis Ltd. 2013
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1080/00207160.2012.762451
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

Computer and Information Systems Abstracts
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1029-0265
EndPage 1170
ExternalDocumentID 3008431661
10_1080_00207160_2012_762451
762451
Genre Feature
GroupedDBID -~X
.4S
.7F
.DC
.QJ
0BK
0R~
29J
30N
4.4
5GY
5VS
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABDBF
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABUFD
ABXUL
ABXYU
ACGEJ
ACGFS
ACGOD
ACIWK
ACNCT
ACUHS
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AI.
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMVHM
AQTUD
ARCSS
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EAP
EBS
EDO
EJD
EMK
EPL
EST
ESX
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
M4Z
MK~
NA5
NY~
O9-
P2P
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEJ
TFL
TFT
TFW
TN5
TTHFI
TUROJ
TUS
TWF
UPT
UT5
UU3
VH1
WH7
ZGOLN
~S~
07G
1TA
AAIKQ
AAKBW
AAYJJ
AAYXX
ABEFU
ACAGQ
ACGEE
ACTCW
ACTIO
AEUMN
AFFNX
AGCQS
AGLEN
AGROQ
AHMOU
ALCKM
AMEWO
AMXXU
AQRUH
BCCOT
BPLKW
C06
CAG
CITATION
COF
CRFIH
DMQIW
DWIFK
H~9
IVXBP
LJTGL
NUSFT
QCRFL
TAQ
TFMCV
TOXWX
UB9
UU8
V3K
V4Q
ZY4
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c401t-13e47da51609d636b5a3e4dd7bcf44525fca442c5ec9816a19cfcd64fb49d3d53
IEDL.DBID TFW
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000320649100003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-7160
IngestDate Fri Sep 05 13:36:18 EDT 2025
Thu Sep 04 18:04:15 EDT 2025
Wed Aug 13 11:15:43 EDT 2025
Tue Nov 18 22:28:26 EST 2025
Sat Nov 29 07:59:42 EST 2025
Mon Oct 20 23:37:23 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c401t-13e47da51609d636b5a3e4dd7bcf44525fca442c5ec9816a19cfcd64fb49d3d53
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
PQID 1372468263
PQPubID 23500
PageCount 21
ParticipantIDs proquest_miscellaneous_1671586291
proquest_miscellaneous_1417897455
crossref_primary_10_1080_00207160_2012_762451
informaworld_taylorfrancis_310_1080_00207160_2012_762451
proquest_journals_1372468263
crossref_citationtrail_10_1080_00207160_2012_762451
PublicationCentury 2000
PublicationDate 2013-06-01
PublicationDateYYYYMMDD 2013-06-01
PublicationDate_xml – month: 06
  year: 2013
  text: 2013-06-01
  day: 01
PublicationDecade 2010
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle International journal of computer mathematics
PublicationYear 2013
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References CIT0001
CIT0012
Comon-Lundh H. (CIT0006) 2007
Charatonik W. (CIT0005) 2010; 57
Flum J. (CIT0010) 2006
CIT0003
CIT0014
CIT0002
Hopcroft J. (CIT0011) 1979
CIT0013
CIT0016
CIT0004
CIT0015
CIT0007
CIT0017
CIT0009
CIT0008
References_xml – ident: CIT0017
  doi: 10.1007/3-540-44674-5_26
– ident: CIT0008
  doi: 10.1007/978-1-4612-0515-9
– ident: CIT0015
  doi: 10.1016/S0167-6423(02)00132-6
– ident: CIT0003
  doi: 10.1109/LICS.2010.28
– ident: CIT0012
  doi: 10.1007/978-3-642-00982-2_38
– volume-title: Tree Automata Techniques and Applications
  year: 2007
  ident: CIT0006
– ident: CIT0007
  doi: 10.1007/BFb0032738
– ident: CIT0013
  doi: 10.1145/318593.318622
– volume-title: Parameterized Complexity Theory
  year: 2006
  ident: CIT0010
– volume: 57
  start-page: 1
  issue: 4
  year: 2010
  ident: CIT0005
  publication-title: J. ACM
– ident: CIT0002
  doi: 10.1007/978-3-642-21254-3_9
– ident: CIT0001
  doi: 10.1016/j.ipl.2005.02.004
– ident: CIT0004
– ident: CIT0009
  doi: 10.1142/S012905411000743X
– ident: CIT0014
  doi: 10.1007/3-540-45127-7_16
– volume-title: Introduction to Automata Theory, Languages, and Computation
  year: 1979
  ident: CIT0011
– ident: CIT0016
  doi: 10.1016/j.jcss.2006.10.003
SSID ssj0008976
Score 1.945409
Snippet There are many decision problems in automata theory (including membership, emptiness, inclusion and universality problems) that are NP-hard for some classes of...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1150
SubjectTerms Algorithms
Automation
classical tree automata
Complexity
Computer science
Mathematical analysis
Mathematical models
Parameter estimation
parameterized complexity theory
rigid tree automata
Signatures
t-DAG automata
Tantalum
Theory
tree automata with global equality and disequality
Trees
Title Parameterized complexity of basic decision problems for tree automata
URI https://www.tandfonline.com/doi/abs/10.1080/00207160.2012.762451
https://www.proquest.com/docview/1372468263
https://www.proquest.com/docview/1417897455
https://www.proquest.com/docview/1671586291
Volume 90
WOSCitedRecordID wos000320649100003&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: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 1029-0265
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008976
  issn: 0020-7160
  databaseCode: TFW
  dateStart: 19640101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JSwMxFA5SPHixrlitEsFrpJlsk6NIiwcpHlx6GzJJBgrSShcRf73vzVIUsYJep3kl85K3zVs-Qi4wFadN1Ew4ZZiEoIK5KDkLxoSgog-hzOg-3prhMB2N7N2nLn4sq8QYuqgGRZS6GoXb5fOmIg47uMEw6h4WZiWXIM2y7KEGxx6v-P3gaaWKU1uiyyEBQ4qmd-6HP_lim75MLv2mqUvzM2j_f-M7ZLt2PelVdVd2yUac7JF2A-tAaynfJ_07hxVbOMT5PQZaFp3HN_DW6bSgYPXGnoYamYfWeDRzCi9BMcFN3XIxBS_YHZCHQf_--obVaAvMQ4yFmPRRmuAU7M8GLXSuHDwJweS-kJj9LLyTMvFwgDbl2nHrCx-0LHJpgwhKHJLWZDqJR4Rq5cFREaDTo5UuVTaPIrE9abSMEG7ZDhENnzNfjyJHRIznjK8mllacypBTWcWpDmErqpdqFMcv69PPR5gtyk8gRYVXkon1pN3muLNapucZFyaRGsIx0SHnq59BGjHF4iZxuoQ1khu4dFKpNWu04QoCScuP_77DE7KVVMAcrMe7pLWYLeMp2fSvi_F8dlZKwQfhRAFg
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dSyMxEA-iwt2LH-cd1s8IvuZoNl-bRxGLYi0-1DvfQppkQThasa2If70zu9miHCoc97qbWbKTzFdmMj9CjjEVp03STHhlmISggvkkOYvGxKhSiLHO6P7qm8GgvL2117macJrLKjGGrppGEbWuRuHGw-i2JA6vcINl1F2szCp-gjhLvES9osDUYlXfsPd7oYxLW-PLIQVDkvb23DtfeWOd3vQu_UtX1waot_4fpr5B1rL3SU-a7bJJltL4G1lvkR1oFvQtcnbtsWgL-zg_p0jruvP0BA47nVQUDN9doDGD89AMSTOl8BcUc9zUz2cTcIT9d3LTOxuenrMMuMAChFkIS5-kiV7B_GzUQo-UhycxmlGoJCZAq-ClLAKsoS259tyGKkQtq5G0UUQlfpDl8WSctgnVKoCvIkCtJyt9qewoicJ2pdEyQcRlO0S0jHYhdyNHUIw_ji-aljaccsgp13CqQ9iC6r7pxvHJ-PL1GrpZfQpSNZAlTnxMuteut8tiPXVcmEJqiMhEhxwtXoNAYpbFj9NkDmMkN7DrpFIfjNGGK4glLd_59xkeki_nw6u-618MLnfJ16LB6WBdvkeWZw_ztE9Ww-PsbvpwUIvECxipBYE
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JaxsxFBbFLSWXuFuI07RVoVcVa7SNjqG1aWkwPritb0KWNGAoY-MlhPz6vDeLsSl1IbmO9YzmSW-bt3yEfMJUnDZJM-GVYRKCCuaT5CwaE6NKIcYqo_vr2oxG-XRqx3td_FhWiTF0UQ-KqHQ1CvcyFm1FHHZwg2HUfSzMyj6DNEvsoX5azcaCGz0Z_t7p4txW8HJIwZCkbZ77x78cGKeD0aV_qerK_gy7j9_5C3La-J70qr4sL8mTVL4i3RbXgTZi_poMxh5LtnCK812KtKo6T7fgrtNFQcHszQONDTQPbQBp1hRegmKGm_rtZgFusH9Dfg4Hky_fWAO3wAIEWQhKn6SJXsH-bNRCz5SHJzGaWSgkpj-L4KXMApygzbn23IYiRC2LmbRRRCXOSKdclOmcUK0CeCoClHqy0ufKzpLIbF8aLRPEW7ZHRMtnF5pZ5AiJ8cfx3cjSmlMOOeVqTvUI21Et61kc_1mf7x-h21TfQIoasMSJ46SX7XG7RqjXjguTSQ3xmOiRj7ufQRwxx-LLtNjCGskNXDqp1JE12nAFkaTlFw_f4QfyfPx16K6_j368JSdZDdLB-vySdDarbXpHnoWbzXy9el8JxD3KIgQl
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=Parameterized+complexity+of+basic+decision+problems+for+tree+automata&rft.jtitle=International+journal+of+computer+mathematics&rft.au=Charatonik%2C+Witold&rft.au=Chorowska%2C+Agata&rft.date=2013-06-01&rft.issn=0020-7160&rft.eissn=1029-0265&rft.volume=90&rft.issue=6&rft.spage=1150&rft.epage=1170&rft_id=info:doi/10.1080%2F00207160.2012.762451&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7160&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7160&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7160&client=summon