{"title":"Anti-Context-Free languages","authors":"Carles Card'o","doi":"10.48550/arXiv.2401.07815","DOIUrl":"https://doi.org/10.48550/arXiv.2401.07815","url":null,"abstract":"Context-free languages can be characterized in several ways. This article studies projective linearisations of languages of simple dependency trees, i.e., dependency trees in which a node can govern at most one node with a given syntactic function. We prove that the projective linearisations of local languages of simple dependency trees coincide with the context-free languages. Simple dependency trees suggest alternative dual notions of locality and projectivity, which permits defining a dual language for each context-free language. We call this new class of languages anti-context-free. These languages are related to some linguistic constructions exhibiting the so-called cross-serial dependencies that were historically important for the development of computational linguistics. We propose that this duality could be a relevant linguistic phenomenon.","PeriodicalId":397960,"journal":{"name":"J. Autom. Lang. Comb.","volume":"2 2","pages":"249-277"},"PeriodicalIF":0.0,"publicationDate":"2024-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140507149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Characterization of Totally Compatible Automata","authors":"David Fernando Casas Torres","doi":"10.25596/jalc-2022-249","DOIUrl":"https://doi.org/10.25596/jalc-2022-249","url":null,"abstract":"Every function on a finite set defines an equivalence relation and, therefore, a partition called the kernel of the function. Automata such that every possible partition is the kernel of a word are called totally compatible. A characterization of such automata is given together with an algorithm to recognize them in polynomial running time with respect to the number of states.","PeriodicalId":397960,"journal":{"name":"J. Autom. Lang. Comb.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127597825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Winning Sets of Regular Languages: Descriptional and Computational Complexity","authors":"Pierre Marcus, Ilkka Törmä","doi":"10.25596/jalc-2023-089","DOIUrl":"https://doi.org/10.25596/jalc-2023-089","url":null,"abstract":"We investigate certain word-construction games with variable turn orders. In these games, Alice and Bob take turns on choosing consecutive letters of a word of fixed length, with Alice winning if the result lies in a predetermined target language. The turn orders that result in a win for Alice form a binary language that is regular whenever the target language is, and we prove some upper and lower bounds for its state complexity based on that of the target language. We also consider the computational complexity of membership and intersection problems of winning sets.","PeriodicalId":397960,"journal":{"name":"J. Autom. Lang. Comb.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131227137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Wadge Degrees of Classes of ω-Regular k-Partitions","authors":"V. Selivanov","doi":"10.25596/jalc-2023-167","DOIUrl":"https://doi.org/10.25596/jalc-2023-167","url":null,"abstract":"We develop a theory of k-partitions of the set of infinite words recognizable by classes of finite automata. The theory enables to complete proofs of existing results about topological classifications of the (aperiodic) omega-regular k-partitions and provides tools for dealing with other similar questions. In particular, we characterize the structure of Wadge degrees of (aperiodic) omega-regular $k$-partitions, prove the decidability of many related problems, and discuss their complexity.","PeriodicalId":397960,"journal":{"name":"J. Autom. Lang. Comb.","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127674674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata","authors":"Taylor J. Smith, K. Salomaa","doi":"10.1007/978-3-030-62536-8_17","DOIUrl":"https://doi.org/10.1007/978-3-030-62536-8_17","url":null,"abstract":"","PeriodicalId":397960,"journal":{"name":"J. Autom. Lang. Comb.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117273774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"State Complexity Bounds for the Commutative Closure of Group Languages","authors":"Stefan Hoffmann","doi":"10.1007/978-3-030-62536-8_6","DOIUrl":"https://doi.org/10.1007/978-3-030-62536-8_6","url":null,"abstract":"","PeriodicalId":397960,"journal":{"name":"J. Autom. Lang. Comb.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115618398","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A combinatorial approach for the state complexity of the Shuffle product","authors":"Pascal Caron, Jean-Gabriel Luque, Bruno Patrou","doi":"10.25596/jalc-2020-291","DOIUrl":"https://doi.org/10.25596/jalc-2020-291","url":null,"abstract":"We investigate the state complexity of the shuffle operation on regular languages initiated by Campeanu et al. and studied subsequently by Brzozowski et al. We shift the problem into the combinatorics domain by turning the problem of state accessibility into a problem of intersection of partitions. This allows us to develop new tools and to reformulate the conjecture of Brzozowski et al. about the above-mentionned state complexity.","PeriodicalId":397960,"journal":{"name":"J. Autom. Lang. Comb.","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131797149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Improvement to a Recent Upper Bound for Synchronizing Words of Finite Automata","authors":"Y. Shitov","doi":"10.25596/jalc-2019-367","DOIUrl":"https://doi.org/10.25596/jalc-2019-367","url":null,"abstract":"It has been known since the 60's that any complete discrete $n$-state automaton admits a reset word of length not exceeding $alpha n^3+o(n^3)$ for some absolute constant $alpha$. J.-E. Pin and P. Frankl proved this statement with $alpha=1/6=0.1666...$ in 1982, and this bound remained best known until 2017, when M. Szykul{}a decreased its value to $alphaapprox0.1664$. In this note, we present a modification to the latest approach and develop a different counting argument which leads to a more substantial improvement of $alphaleqslant 0.1654$.","PeriodicalId":397960,"journal":{"name":"J. Autom. Lang. Comb.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127002318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Counting symbol switches in synchronizing automata","authors":"H. Don, H. Zantema","doi":"10.25596/jalc-2019-253","DOIUrl":"https://doi.org/10.25596/jalc-2019-253","url":null,"abstract":"Instead of looking at the lengths of synchronizing words as in v{C}ern'y's conjecture, we look at the switch count of such words, that is, we only count the switches from one letter to another. Where the synchronizing words of the v{C}ern'y automata $mathcal{C}_n$ have switch count linear in $n$, we wonder whether synchronizing automata exist for which every synchronizing word has quadratic switch count. The answer is positive: we prove that switch count has the same complexity as synchronizing word length. We give some series of synchronizing automata yielding quadratic switch count, the best one reaching $frac{2}{3} n^2 + O(n)$ as switch count. \u0000We investigate all binary automata on at most 9 states and determine the maximal possible switch count. For all $3leq nleq 9$, a strictly higher switch count can be reached by allowing more symbols. This behaviour differs from length, where for every $n$, no automata are known with higher synchronization length than $mathcal{C}_n$, which has only two symbols. It is not clear if this pattern extends to larger $n$. For $ngeq 12$, our best construction only has two symbols.","PeriodicalId":397960,"journal":{"name":"J. Autom. Lang. Comb.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127017915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Slowly Synchronizing Automata with Idempotent Letters of Low Rank","authors":"Mikhail Volkov","doi":"10.25596/jalc-2019-375","DOIUrl":"https://doi.org/10.25596/jalc-2019-375","url":null,"abstract":"We use a semigroup-theoretic construction by Peter Higgins in order to produce, for each even $n$, an $n$-state and 3-letter synchronizing automaton with the following two features: 1) all its input letters act as idempotent selfmaps of rank $dfrac{n}2$; 2) its reset threshold is asymptotically equal to $dfrac{n^2}2$. \u0000In the revised version a few inaccuracies (spotted by the anonymous referees of the previous version) have been removed and several relevant references have been added.","PeriodicalId":397960,"journal":{"name":"J. Autom. Lang. Comb.","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131856223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}