Hiroyuki Chigahara, Szilárd Zsolt Fazekas & Akihiro Yamamura (2016):
One-Way Jumping Finite Automata.
Int. J. Found. Comput. Sci. 27(3),
pp. 391,
doi:10.1142/S0129054116400165.
John Cocke & Marvin Minsky (1964):
Universality of Tag Systems with P = 2.
Journal of the ACM 11(1),
pp. 15–20,
doi:10.1145/321203.321206.
Matthew Cook (2004):
Universality in Elementary Cellular Automata.
Complex Systems 15,
pp. 1–40,
doi:10.25088/ComplexSystems.15.1.1.
Szilárd Zsolt Fazekas, Robert Mercas & Olívia Wu (2022):
Complexities for Jumps and Sweeps.
J. Autom. Lang. Comb. 27(1-3),
pp. 131–149,
doi:10.25596/jalc-2022-131.
Cody Geary, Pierre-Étienne Meunier, Nicolas Robertabanel & Shinnosuke Seki (2018):
Proving the Turing Universality of Oritatami Co-Transcriptional Folding.
In: Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC 2018),
LIPIcs 123,
pp. 23:1–23:13,
doi:10.4230/LIPIcs.ISAAC.2018.23.
Lane A. Hemaspaandra, Proshanto Mukherji & Till Tantau (2005):
Context-Free Languages Can Be Accepted with Absolutely No Space Overhead.
Information and Computation 203(2),
pp. 163–180,
doi:10.1016/j.ic.2005.05.005.
A. B. Kahn (1962):
Topological Sorting of Large Networks.
Commun. ACM 5(11),
pp. 558–562,
doi:10.1145/368996.369025.
Martin Kutrib, Andreas Malcher, Carlo Mereghetti & Beatrice Palano (2022):
Descriptional Complexity of Iterated Uniform Finite-State Transducers.
Information and Computation 284,
pp. 104691,
doi:10.1016/j.ic.2021.104691.
Selected Papers from DCFS 2019, the 21st International Conference on Descriptional Complexity of Formal Systems.
Martin Kutrib, Andreas Malcher & Matthias Wendlandt (2018):
Queue Automata: Foundations and Developments,
pp. 385–431.
Springer International Publishing,
Cham,
doi:10.1007/978-3-319-73216-9_19.
Ming Li, Luc Longpré & Paul Vitányi (1992):
The Power of the Queue.
SIAM Journal on Computing 21(4),
pp. 697–712,
doi:10.1137/0221042.
J. Andres Montoya (2015):
Open Problems Related to Palindrome Recognition: Are There Open Problems Related to Palindrome Recognition?.
J. Autom. Lang. Comb. 20(1),
pp. 5–25,
doi:10.25596/jalc-2015-005.
Daria Pchelina, Nicolas Schabanel, Shinnosuke Seki & Guillaume Theyssier (2022):
Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (aTAM).
In: Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022),
LIPIcs 219,
pp. 51:1–51:23,
doi:10.4230/LIPIcs.STACS.2022.51.
Emil L. Post (1946):
A Variant of a Recursively Unsolvable Problem.
Bull. Amer. Math. Soc. 52,
pp. 264–268,
doi:10.1090/S0002-9904-1946-08555-9.
Edward Szpilrajn (1930):
Sur l'extension de l'ordre partiel.
Fundamenta Mathematicae 16,
pp. 386–389,
doi:10.4064/fm-16-1-386-389.
Kyle E. Watters, Eric J. Strobel, Angela M. Yu, John T. Lis & Julius B. Lucks (2016):
Cotranscriptional Folding of a Riboswitch at Nucleotide Resolution.
Nature Structural and Molecular Biology 23(12),
pp. 1124–1131,
doi:10.1038/nsmb.3316.
Sheng Yu (1989):
A Pumping Lemma for Deterministic Context-Free Languages.
Information Processing Letters 31(1),
pp. 47–51,
doi:10.1016/0020-0190(89)90108-7.
Charles Zaiontz (1976):
Circular Automata.
In: Proceedings of the 14th Annual Southeast Regional Conference (ACM-SE 14),
pp. 350–354,
doi:10.1145/503561.503635.
eptcs@eptcs.org