default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 288
Volume 288, October 2022
- Ondrej Klíma, Peter Kostolányi
:
Geometrically closed positive varieties of languages. 104709 - Hans Zantema, Wieb Bosma:
Complexity of automatic sequences. 104710 - M. Utkan Gezer, A. C. Cem Say:
Constant-space, constant-randomness verifiers with arbitrarily small error. 104744 - Jean Néraud:
Variable-length codes independent or closed with respect to edit relations. 104747 - Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
On the complexity of approximately matching a string to a directed graph. 104748 - Dmitry Berdinsky, Murray Elder, Prohrak Kruengthomya:
Cayley polynomial-time computable groups. 104768 - Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On the Weisfeiler-Leman dimension of fractional packing. 104803 - Ahmet Bilal Uçan, A. C. Cem Say:
Advice hierarchies among finite automata. 104878 - Aaron Lye:
Context-sensitive fusion grammars and fusion grammars with forbidden context are universal. 104889 - Carlos Martín-Vide, Bianca Truthe:
Special Issue: Selected papers of the 14th International Conference on Language and Automata Theory and Applications, LATA 2020. 104912
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-15 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
