Special issue: Selected papers of the 14th international conference on language and automata theory and applications, LATA 2020. (English) Zbl 1496.00072
From the text: This special issue of the journal Information and Computation contains extended versions of some papers that were accepted for presentation at the 14th International Conference on Language and Automata Theory and Applications (LATA 2020) which was planned to take place in Milan, Italy, on March 4–6, 2020.
MSC:
| 00B25 | Proceedings of conferences of miscellaneous specific interest |
| 68-06 | Proceedings, conferences, collections, etc. pertaining to computer science |
| 68Q45 | Formal languages and automata |
References:
| [1] | Arvind, V.; Fuhlbrück, F.; Köbler, J.; Verbitsky, O., On the Weisfeiler-Leman dimension of fractional packing, Inf. Comput., 288, Article 104803 pp. (2022) · Zbl 1537.68106 |
| [2] | Berdinsky, D.; Elder, M.; Kruengthomya, P., Cayley polynomial-time computable groups, Inf. Comput., 288, Article 104768 pp. (2022) · Zbl 07601279 |
| [3] | Dondi, R.; Mauri, G.; Zoppis, I., On the complexity of approximately matching a string to a directed graph, Inf. Comput., 288, Article 104748 pp. (2022) · Zbl 1498.68202 |
| [4] | Gezer, M. U.; Say, A. C.C., Constant-space, constant-randomness verifiers with arbitrarily small error, Inf. Comput., 288, Article 104744 pp. (2022) · Zbl 1537.68071 |
| [5] | Klíma, O.; Kostolányi, P., Geometrically closed positive varieties of languages, Inf. Comput., 288, Article 104709 pp. (2022) · Zbl 07601274 |
| [6] | Lye, A., Context-sensitive fusion grammars and fusion grammars with forbidden context are universal, Inf. Comput., 288, Article 104889 pp. (2022) · Zbl 1537.68061 |
| [7] | Néraud, J., Variable-length codes independent or closed with respect to edit relations, Inf. Comput., 288, Article 104747 pp. (2022) · Zbl 1537.68079 |
| [8] | Uçan, A. B.; Say, A. C.C., Advice hierarchies among finite automata, Inf. Comput., 288, Article 104878 pp. (2022) · Zbl 1537.68083 |
| [9] | Zantema, H.; Bosma, W., Complexity of automatic sequences, Inf. Comput., 288, Article 104710 pp. (2022) · Zbl 1542.68089 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
