


default search action
Journal of Automata, Languages and Combinatorics, Volume 26
Volume 26, Numbers 1-2, 2021
- Szilárd Zsolt Fazekas:

Preface. 3-5 - Chiara Bindi, Marco Pellegrini, Giuseppe Pirillo:

Some Results about Maximal Primitive Sets. 7-15 - Sabine Broda

, Eva Maia
, Nelma Moreira
, Rogério Reis
:
The Prefix Automaton. 17-53 - Carolin Hannusch

, Géza Horváth:
Properties of Hash Functions based on Gluškov Product of Automata. 55-65 - Olga Karpova, Arseny M. Shur:

Words Separation and Positive Identities in Symmetric Groups. 67-89 - Peter Leupold:

On the Unavoidability of Primitive Words and other Languages. 91-107 - Victor Mitrana

, Andrei Paun, Mihaela Paun, José Ángel Sánchez Martín:
Non-preserving Accepting Splicing Systems. 109-124 - Kenichi Morita

:
Constructing Reversible Turing Machines in a Reversible and Conservative Elementary Triangular Cellular Automaton. 125-144 - Frantisek Mráz

, Friedrich Otto, Dana Pardubská
, Martin Plátek
:
Lexicalized Syntactic Analysis by Two-Way Restarting Automata. 145-171
Volume 26, Numbers 3-4, 2021
- David Callan, Toufik Mansour

, José Luis Ramírez:
Statistics on Bargraphs of Catalan Words. 177-196 - Sigrid Ewert, Joy Idahosa:

Ogden's Lemma for Subclasses of Random Context Galleries. 197-220 - Lukas Fleischer, Jeffrey O. Shallit:

Automata, Palindromes, and Reversed Subwords. 221-253 - Lila Kari, Manasi S. Kulkarni, Kalpana Mahalingam, Zihao Wang:

Involutive Fibonacci Words. 255-280 - Stoyan Mihov, Klaus U. Schulz:

F-Transducers for Contextual Text Rewriting. 281-332

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














