Abstract
We present a class of irregular languages defined by means of the change of number systems.
Keywords: formal languages; regular and irregular languages; pumping lemma; uniformly distributed sequences
Note: Originally published in Diskretnaya Matematika (2021) 33,№3, 41–45 (in Russian).
References
[1] Pólya G., Szegö G., Aufgaben und Lehrsatze aus der Analysis, Springer-Verlag, 1964, XVI, 338 pp.10.1007/978-3-662-00061-8Suche in Google Scholar
[2] Hopcroft J. E., Motwani R., Ullman J. D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 2001, 521 pp.Suche in Google Scholar
Received: 2020-12-24
Published Online: 2022-12-06
Published in Print: 2022-12-16
© 2022 Walter de Gruyter GmbH, Berlin/Boston
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Some cardinality estimates for the set of correlation-immune Boolean functions
- Invertible matrices over some quotient rings: identification, generation, and analysis
- Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
- Contents
- On a class of irregular languages
- On the membership problem for finite automata over symmetric groups
- On the asymptotic normality conditions for the number of repetitions in a stationary random sequence
- On implementation of Boolean functions by contact circuits of minimal uniform width
- Retraction
- Some cardinality estimates for the set of correlation-immune Boolean functions
- Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
- Invertible matrices over some quotient rings: identification, generation, and analysis
Schlagwörter für diesen Artikel
formal languages;
regular and irregular languages;
pumping lemma;
uniformly distributed sequences
Artikel in diesem Heft
- Some cardinality estimates for the set of correlation-immune Boolean functions
- Invertible matrices over some quotient rings: identification, generation, and analysis
- Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
- Contents
- On a class of irregular languages
- On the membership problem for finite automata over symmetric groups
- On the asymptotic normality conditions for the number of repetitions in a stationary random sequence
- On implementation of Boolean functions by contact circuits of minimal uniform width
- Retraction
- Some cardinality estimates for the set of correlation-immune Boolean functions
- Synthesis of reversible circuits consisting of NOT, CNOT and 2-CNOT gates with small number of additional inputs
- Invertible matrices over some quotient rings: identification, generation, and analysis