Trahtman, A. N. An algorithm to verify local threshold testability of deterministic finite automata. (English) Zbl 1050.68097 Boldt, Oliver (ed.) et al., Automata implementation. 4th international workshop, WIA ’99, Potsdam, Germany, July 17–19, 1999. Revised papers. Berlin: Springer (ISBN 3-540-42812-7). Lect. Notes Comput. Sci. 2214, 164-173 (2001). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. N. Trahtman}, Lect. Notes Comput. Sci. 2214, 164--173 (2001; Zbl 1050.68097) Full Text: arXiv Link
Allauzen, Cyril; Crochemore, Maxime; Raffinot, Mathieu Efficient experimental string matching by weak factor recognition. (English) Zbl 0992.68501 Amir, Amihood (ed.) et al., Combinatorial pattern matching. 12th annual symposium, CPM 2001, Jerusalem, Israel, July 1-4, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2089, 51-72 (2001). MSC: 68P10 68R15 68P20 68Q45 PDFBibTeX XMLCite \textit{C. Allauzen} et al., Lect. Notes Comput. Sci. 2089, 51--72 (2001; Zbl 0992.68501)
Gabrijel, Ivan; Dobnikar, Andrej On-line identification and rule extraction of finite state automata with recurrent neural networks. (English) Zbl 1011.68084 Kůrková, Věra (ed.) et al., Artificial neural nets and genetic algorithms. Proceedings of the international conference, Prague, Czech Republic, 2001. Wien: Springer. 78-81 (2001). MSC: 68T05 68Q45 PDFBibTeX XMLCite \textit{I. Gabrijel} and \textit{A. Dobnikar}, in: Artificial neural nets and genetic algorithms. Proceedings of the international conference, Prague, Czech Republic, 2001. Wien: Springer. 78--81 (2001; Zbl 1011.68084)
Karamanos, K. Entropy analysis of substitutive sequences revisited. (English) Zbl 1008.94009 J. Phys. A, Math. Gen. 34, No. 43, 9231-9241 (2001). MSC: 94A17 11B85 68Q30 37B10 68Q45 68R15 PDFBibTeX XMLCite \textit{K. Karamanos}, J. Phys. A, Math. Gen. 34, No. 43, 9231--9241 (2001; Zbl 1008.94009) Full Text: DOI
Demri, Stéphane The complexity of regularity in grammar logics and related modal logics. (English) Zbl 1002.03018 J. Log. Comput. 11, No. 6, 933-960 (2001). MSC: 03B45 68Q42 68Q45 68Q25 03D05 03B25 03D15 PDFBibTeX XMLCite \textit{S. Demri}, J. Log. Comput. 11, No. 6, 933--960 (2001; Zbl 1002.03018) Full Text: DOI HAL
Nekrashevich, V. V.; Sushchanskij, V. I. Automata with restricted memory and shift endomorphisms. (Ukrainian. English summary) Zbl 0980.20066 Dopov. Nats. Akad. Nauk Ukr., Mat. Pryr. Tekh. Nauky 2001, No. 4, 18-21 (2001). Reviewer: A.P.Petravchuk (Kyïv) MSC: 20M35 20M20 68Q45 20M05 PDFBibTeX XMLCite \textit{V. V. Nekrashevich} and \textit{V. I. Sushchanskij}, Dopov. Nats. Akad. Nauk Ukr., Mat. Pryr. Tekh. Nauky 2001, No. 4, 18--21 (2001; Zbl 0980.20066)
Lautemann, Clemens; McKenzie, Pierre; Schwentick, Thomas; Vollmer, Heribert The descriptive complexity approach to LOGCFL. (English) Zbl 0983.68108 J. Comput. Syst. Sci. 62, No. 4, 629-652 (2001). MSC: 68Q45 PDFBibTeX XMLCite \textit{C. Lautemann} et al., J. Comput. Syst. Sci. 62, No. 4, 629--652 (2001; Zbl 0983.68108) Full Text: DOI
Hromkovič, Juraj; Seibert, Sebastian; Wilke, Thomas Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata. (English) Zbl 1014.68093 J. Comput. Syst. Sci. 62, No. 4, 565-588 (2001). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Hromkovič} et al., J. Comput. Syst. Sci. 62, No. 4, 565--588 (2001; Zbl 1014.68093) Full Text: DOI Link
Yu, Sheng State complexity of regular languages. (English) Zbl 0978.68087 J. Autom. Lang. Comb. 6, No. 2, 221-234 (2001). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. Yu}, J. Autom. Lang. Comb. 6, No. 2, 221--234 (2001; Zbl 0978.68087)
Ye, Dingfeng; Dai, Zongduo; Lam, Kwok-Yan Decomposing attacks on asymmetric cryptography based on mapping compositions. (English) Zbl 1021.94526 J. Cryptology 14, No. 2, 137-150 (2001). MSC: 94A60 12Y05 PDFBibTeX XMLCite \textit{D. Ye} et al., J. Cryptology 14, No. 2, 137--150 (2001; Zbl 1021.94526)