Automata theory in nominal sets

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize...

Full description

Saved in:
Bibliographic Details
Published inLogical methods in computer science Vol. 10, Issue 3
Main Authors Bojańczyk, Mikołaj, Klin, Bartek, Lasota, Sławomir
Format Journal Article
LanguageEnglish
Published Logical Methods in Computer Science e.V 15.08.2014
Subjects
computer science - formal languages and automata theory
computer science - logic in computer science
Online AccessGet full text
ISSN1860-5974
1860-5974
DOI10.2168/LMCS-10(3:4)2014

Cover

Abstract We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize nominal sets due to Gabbay and Pitts.
AbstractList We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize nominal sets due to Gabbay and Pitts.
We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize nominal sets due to Gabbay and Pitts.
Author Klin, Bartek
Bojańczyk, Mikołaj
Lasota, Sławomir
Author_xml – sequence: 1
  givenname: Mikołaj
  surname: Bojańczyk
  fullname: Bojańczyk, Mikołaj
– sequence: 2
  givenname: Bartek
  orcidid: 0000-0001-5793-7425
  surname: Klin
  fullname: Klin, Bartek
– sequence: 3
  givenname: Sławomir
  orcidid: 0000-0001-8674-4470
  surname: Lasota
  fullname: Lasota, Sławomir
BookMark eNp1kMtLAzEQxoNUsNbevblHPazmnY23svgoVDyo5zC7TTRlu5EkHvrfu2sVRHDmMA_4vhl-x2jSh94idErwJSWyulo91E8lwefsml9QTPgBmpJK4lJoxSe_-iM0T2mDh2CMVFRO0dniI4ctZCjymw1xV_i-6MPW99AVyeZ0gg4ddMnOv-sMvdzePNf35erxblkvVmXLicqlY0QzAkxK0ljHncBYMUe5bbRumV1LShspKmZ1S60WhFvWSJBCrysuHKFshpZ733WAjXmPfgtxZwJ487UI8dVAzL7trGkq12guOGcK80ZJUK0dbikQoOyQg5fce7UxpBStM63PkH3ocwTfGYLNSM2M1MaBGW5GaoMQ_xH-PPKv5BOJAm8h
CitedBy_id crossref_primary_10_1587_transinf_2019FCP0010
crossref_primary_10_1017_S0960129521000438
crossref_primary_10_1093_logcom_exz015
crossref_primary_10_1145_2893582_2893594
crossref_primary_10_1016_j_tcs_2022_09_002
crossref_primary_10_4204_EPTCS_304_9
crossref_primary_10_1587_transinf_2022FCP0004
crossref_primary_10_1007_s00500_017_2793_2
crossref_primary_10_4204_EPTCS_320_2
crossref_primary_10_1007_s00165_020_00526_z
crossref_primary_10_1145_3090064_3090066
crossref_primary_10_1007_s00453_022_01017_8
crossref_primary_10_1016_j_tcs_2017_08_003
crossref_primary_10_1515_jgth_2018_0220
crossref_primary_10_1587_transinf_2020EDP7265
crossref_primary_10_1145_3326161
crossref_primary_10_1587_transinf_2020FCP0008
crossref_primary_10_1016_j_jcss_2020_09_003
crossref_primary_10_4204_EPTCS_207_3
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.2168/LMCS-10(3:4)2014
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_b8fb945443704b76a7ce3f27a5a7e7e7
10_2168_LMCS_10_3_4_2014
GroupedDBID .4S
.DC
29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADMLS
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
MK~
ML~
M~E
OK1
OVT
P2P
TR2
TUS
XSB
ID FETCH-LOGICAL-c417t-f31931a3661bef4f50073f24eb99c3ed622b6583e9c2e9514e3b6a659d845f123
IEDL.DBID DOA
ISSN 1860-5974
IngestDate Wed Aug 27 01:32:58 EDT 2025
Thu Apr 24 22:54:24 EDT 2025
Tue Jul 01 04:10:24 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://arxiv.org/licenses/nonexclusive-distrib/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c417t-f31931a3661bef4f50073f24eb99c3ed622b6583e9c2e9514e3b6a659d845f123
ORCID 0000-0001-5793-7425
0000-0001-8674-4470
OpenAccessLink https://doaj.org/article/b8fb945443704b76a7ce3f27a5a7e7e7
ParticipantIDs doaj_primary_oai_doaj_org_article_b8fb945443704b76a7ce3f27a5a7e7e7
crossref_citationtrail_10_2168_LMCS_10_3_4_2014
crossref_primary_10_2168_LMCS_10_3_4_2014
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2014-08-15
PublicationDateYYYYMMDD 2014-08-15
PublicationDate_xml – month: 08
  year: 2014
  text: 2014-08-15
  day: 15
PublicationDecade 2010
PublicationTitle Logical methods in computer science
PublicationYear 2014
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
References 717:not-found
References_xml – ident: 717:not-found
SSID ssj0000331826
Score 2.3885827
Snippet We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such...
We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such...
SourceID doaj
crossref
SourceType Open Website
Enrichment Source
Index Database
SubjectTerms computer science - formal languages and automata theory
computer science - logic in computer science
Title Automata theory in nominal sets
URI https://doaj.org/article/b8fb945443704b76a7ce3f27a5a7e7e7
Volume 10, Issue 3
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQWVh4I8qjZGCgQ9QmftVspVBVqGUplbpFdnKWkFCKaDrw77lL0qossKBMic6Rfefc99nO3TF2q5HSm1TqMDPahgK0DK3XWei1hsx2Tao5RSNPXtRoJp7ncr5V6ov-CavSA1eK67ied0ZQljbdFU4rq1PgPtZWWg14kfdFzNtaTJU-mHMiztW5ZBypXmc8GUzR59zxe9FG0BM_cGgrXX-JK8NDtl8TwqBfdeSI7UB-zA7WxRaC-ts7YTf9VbFAemmDMvbwK3jLAwoppsZLKJanbDZ8eh2Mwrq6QZiKSBehx8nPI8sRIB144SUdmvlYgEPlcchUHDukBxxMGgPyIAHcKaukyXpCegScM9bIFzmcs0AKrkhKAqRCGmlwgNJTyQdpfWRNk3XWY03SOvU3VaB4T3AJQNpJSDt0wxORkHaarL1p8VGlvfhF9oHUt5GjhNXlAzRjUpsx-cuMF__xkku2Rx2iLd9IXrFG8bmCa-QMhWux3f7jZDxtldPkG1rvvRA
linkProvider Directory of Open Access Journals
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=Automata+theory+in+nominal+sets&rft.jtitle=Logical+methods+in+computer+science&rft.au=Boja%C5%84czyk%2C+Miko%C5%82aj&rft.au=Klin%2C+Bartek&rft.au=Lasota%2C+S%C5%82awomir&rft.date=2014-08-15&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=10%2C+Issue+3&rft_id=info:doi/10.2168%2FLMCS-10%283%3A4%292014&rft.externalDBID=n%2Fa&rft.externalDocID=10_2168_LMCS_10_3_4_2014
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon