Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words

We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the case of finite words, where the problem is decidable. Further...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Mathematics and Theoretical Computer Science Vol. 21; no. 3; pp. 1 - 32
Main Authors: Loding, Christof, Spinrath, Christopher
Format: Journal Article
Language:English
Published: Nancy DMTCS 01.07.2019
Subjects:
Algorithms
Decision theory
Machine theory
Mathematical research
Polynomials
Germany
ISSN:1462-7264, 1365-8050
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the case of finite words, where the problem is decidable. Furthermore, we show that it is decidable in doubly exponential time for an automatic relation over infinite words whether it is a recognizable relation. We also revisit this problem in the context of finite words and improve the complexity of the decision procedure to single exponential time. The procedure is based on a polynomial time regularity test for deterministic visibly pushdown automata, which is a result of independent interest. Keywords: rational relations, automatic relations, omega-automata, finite transducers, visibly pushdown automata
AbstractList We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the case of finite words, where the problem is decidable. Furthermore, we show that it is decidable in doubly exponential time for an automatic relation over infinite words whether it is a recognizable relation. We also revisit this problem in the context of finite words and improve the complexity of the decision procedure to single exponential time. The procedure is based on a polynomial time regularity test for deterministic visibly pushdown automata, which is a result of independent interest. Keywords: rational relations, automatic relations, omega-automata, finite transducers, visibly pushdown automata
We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the case of finite words, where the problem is decidable. Furthermore, we show that it is decidable in doubly exponential time for an automatic relation over infinite words whether it is a recognizable relation. We also revisit this problem in the context of finite words and improve the complexity of the decision procedure to single exponential time. The procedure is based on a polynomial time regularity test for deterministic visibly pushdown automata, which is a result of independent interest.
Audience Academic
Author Loding, Christof
Spinrath, Christopher
Author_xml – sequence: 1
  fullname: Loding, Christof
– sequence: 2
  fullname: Spinrath, Christopher
BookMark eNptkE1LAzEQhoNUsNb-h4DnlWw-u8dSrRYKSrV4XLLJpES2iSa7_n6DFfTgzGHeeXlmGOYSTUIMcIamNZOiWhBBJkVzSStFJb9A85x9RzhXjMtGTNH-FozPPgb8lGLXwzFjFxN-HjvT65wh4-jwTg-F0D3eQf8ti_sJCa998ANgHSzeBHdqXmOy-QqdO91nmP_UGdqv715WD9X28X6zWm6rAxVkqIDUUkHTsIaSjjnGgYGpuQMCTglgmjBpiQFNOg41obWzwpUgVnRUWMVm6Pq09z3FjxHy0L7FMZVLc8sIbxaMskb-UgfdQ-uDi0PS5uizaZeSKkU5LegM3fxDlbRw9KY81fni_xn4AunrbEw
ContentType Journal Article
Copyright COPYRIGHT 2019 DMTCS
Copyright DMTCS 2019
Copyright_xml – notice: COPYRIGHT 2019 DMTCS
– notice: Copyright DMTCS 2019
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BFMQW
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DatabaseName 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
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
DatabaseTitle 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

Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1365-8050
EndPage 32
ExternalDocumentID A627724298
GeographicLocations Germany
GeographicLocations_xml – name: Germany
GroupedDBID ALMA_UNASSIGNED_HOLDINGS
M~E
-~9
.4S
.DC
29G
2WC
5GY
5VS
8FE
8FG
AAFWJ
ABDBF
ABJCF
ABUWG
ACGFO
ACIWK
ACUHS
ADBBV
ADOJU
ADQAK
AENEX
AFKRA
AFPKN
AIAGR
AMVHM
ARCSS
AZQEC
B0M
BCNDV
BENPR
BFMQW
BGLVJ
BPHCQ
CCPQU
DWQXO
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
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PROAC
PTHSS
PV9
REM
RNS
RSU
RZL
TR2
TUS
XSB
~8M
ID FETCH-LOGICAL-g250t-e0167e993920b3f34e3ec14fe0ef75e3a036d0cea0b4e1021fd5ffff0d5b25d73
IEDL.DBID M7S
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000480436900010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1462-7264
IngestDate Fri Jul 25 12:11:51 EDT 2025
Wed Mar 19 01:48:23 EDT 2025
Sat Mar 08 18:09:32 EST 2025
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-g250t-e0167e993920b3f34e3ec14fe0ef75e3a036d0cea0b4e1021fd5ffff0d5b25d73
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/3049832396?pq-origsite=%requestingapplication%
PQID 3049832396
PQPubID 946337
PageCount 32
ParticipantIDs proquest_journals_3049832396
gale_infotracmisc_A627724298
gale_infotracacademiconefile_A627724298
PublicationCentury 2000
PublicationDate 20190701
PublicationDateYYYYMMDD 2019-07-01
PublicationDate_xml – month: 07
  year: 2019
  text: 20190701
  day: 01
PublicationDecade 2010
PublicationPlace Nancy
PublicationPlace_xml – name: Nancy
PublicationTitle Discrete Mathematics and Theoretical Computer Science
PublicationYear 2019
Publisher DMTCS
Publisher_xml – name: DMTCS
SSID ssib044734695
ssj0012947
Score 2.1364982
Snippet We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary...
SourceID proquest
gale
SourceType Aggregation Database
StartPage 1
SubjectTerms Algorithms
Decision theory
Machine theory
Mathematical research
Polynomials
Title Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words
URI https://www.proquest.com/docview/3049832396
Volume 21
WOSCitedRecordID wos000480436900010&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: 1462-7264
  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: 1462-7264
  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: 1462-7264
  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: 1462-7264
  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: 1462-7264
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1462-7264
  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/eLvHCXMwpV1LT8JAEJ4oeNCDKGpEkezBxFNj2-3zZFAhcoA0KBFPpO3OGi5FafXob3e2XTAkxos9NGm3zSad17c70_kALimKU5AO0CCwSgsUnydGzB1hUPBGy-SxLcKkJJvwR6NgOg0jveGW67LKlU8sHbVYpGqP_Fqlg0j7eOjdvL0bijVKZVc1hcY21FWXBKss3XtcZxHssGRN-dXVlvGj3_jvzAewr5Ej61aiPoQtzJrQWLEyMG2kTdgbrjux5kcwudckOiyqqGNyRjCVkb9IFW7GnC0kG-sdQbYujWOqspP15wqRsjgTbJDJ6uKZVqv5MUz6vae7B0NTKRivhHEKA9XfBkhYJLTNhEvuIMfUciSaKH0XeUyBTJgpxmbioGL7lsKVdJjCTWxX-PwEatkiw1NghDnQ9SS60uJk_TJILfQsK8aQsIjgvAVX6oPPlIEUyziNdZ0_va1aTc26nk2InsJg0IL2xpOk2Onm8EoeM21Y-exHGGd_D5_DLmGbsKqsbUOtWH7gBeykn8U8X3agftsbReNOqS_q_NWje9FgGL18AzWAz3M
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NT8JAEJ0gmqgHUdSIou5B46mx7VKgB2OISCB8hChEbrXtzhouRWnV-Kf8jc72A0NivHmwt2bbJpuZvnmzM7sP4IyiOAXpOmpEVilBqXFPc3lFaBS80dC5awrbi8UmaoNBfTKxhzn4zPbCqLbKDBNjoBYzX62RX6pyEHkft6vXzy-aUo1S1dVMQiNxiy5-vFPKFl51mmTfc9Ns3Y5u2lqqKqA9UbiPNFSN90hh2TZ1j0teQY6-UZGoo6xZyF3CdKH76OpeBZXwtRSWpEsXlmdaosbpuyuwSjTCtONWwftF1cK0Y5WWH6E9jletwn-b6TZspcyYNRJX3oEcBkUoZKoTLAWhImz2FyfNhrswbqYiQWyYSOOEjGg4Izz0VV6AIZtJdpeueLJF6x9TnausNVWMm7mBYJ1AJjcPasJ7MP6Tqe5DPpgFeACMOBVaVYmWNDihm6z7BlYNw0WbuJbgvAQXysCOAoBo7vpuuo-B3lZHaTmNqkkZC4X5egnKS0_Sj-svD2f2d1LgCJ1v4x_-PnwK6-1Rv-f0OoPuEWwQj7OTLuIy5KP5Kx7Dmv8WTcP5SeyjDB7_2lW-AO_aKa8
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=Decision+Problems+for+Subclasses+of+Rational+Relations+over+Finite+and+Infinite+Words&rft.jtitle=Discrete+Mathematics+and+Theoretical+Computer+Science&rft.au=Loding%2C+Christof&rft.au=Spinrath%2C+Christopher&rft.date=2019-07-01&rft.pub=DMTCS&rft.issn=1462-7264&rft.volume=21&rft.issue=3&rft.spage=1&rft.externalDocID=A627724298
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1462-7264&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1462-7264&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1462-7264&client=summon