Adding nesting structure to words, J. ACM, vol.56, issue.3, p.43, 2009. ,
The algebraic theory of context-free languages, Stud. Logic Found. Math, vol.35, pp.118-161, 1963. ,
Finite automata and unary languages, Theoret. Comput. Sci, vol.47, issue.3, pp.90142-90150, 1986. ,
Two families of languages related to ALGOL, J. ACM, vol.9, issue.3, pp.350-371, 1962. ,
Two-way automata and onetape machines -Read only versus linear time, DLT 2018, vol.11088, pp.366-378, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-02079083
Linear-time limited automata, Theoret. Comput. Sci, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-01905632
Context-free languages can be accepted with absolutely no space overhead, Inform. and Comput, vol.203, issue.2, pp.163-180, 2005. ,
One-tape, off-line Turing machine computations, Information and Control, vol.8, issue.6, pp.553-578, 1965. ,
A generalization of context-free determinism, Information and Control, vol.11, issue.1/2, pp.196-238, 1967. ,
Characterization of context-free languages by erasing automata, MFCS 1992, vol.629, pp.307-314, 1992. ,
A taxonomy of forgetting automata, MFCS 1993, vol.711, pp.527-536, 1993. ,
Forgetting automata and context-free languages, Acta Inform, vol.33, issue.5, pp.409-420, 1996. ,
Restarting automata, FCT 1995, vol.965, pp.283-292, 1995. ,
Descriptional complexity of limited automata, Inform. and. Comput, vol.259, issue.2, pp.259-276, 2018. ,
On simulation cost of unary limited automata, DCFS 2015, vol.9118, pp.153-164, 2015. ,
Reversible limited automata, Fund. Inform, vol.155, issue.1-2, pp.31-58, 2017. ,
Pebbling moutain ranges and its application of DCFL-recognition, ICALP 1980, vol.85, pp.422-435, 1980. ,
Deterministic realization of nondeterministic computations with a low measure of nondeterminism, Cybernetics, vol.27, issue.2, pp.170-179, 1991. ,
An "interchange lemma" for contextfree languages, SIAM J. Comput, vol.14, issue.2, pp.410-415, 1985. ,
Non-erasing variants of the Chomsky-Schützenberger theorem, DLT 2012, vol.7410, pp.121-129, 2012. ,
Restarting automata and their relations to the Chomsky hierarchy, DLT 2003, vol.2710, pp.55-74, 2003. ,
On a deterministic subclass of context-free languages, MFCS 1977, vol.53, pp.430-434, 1977. ,
A deterministic subclass of context-free languages, ?asopis pro p?stování matematiky, vol.103, issue.1, pp.43-52, 1978. ,
Nondeterministic one-tape off-line Turing machines, J. Autom. Lang. Comb, vol.14, issue.1, pp.107-124, 2009. ,
Two-way finite automata: Old and recent results, Fund. Inform, vol.126, issue.2-3, pp.225-246, 2013. ,
Guest column: One-tape Turing machine variants and language recognition, SIGACT News, vol.46, issue.3, pp.37-55, 2015. ,
Strongly limited automata, Fund. Inform, vol.148, issue.3-4, pp.369-392, 2016. ,
Limited automata and regular languages. Internat, J. Found. Comput. Sci, vol.25, issue.7, pp.897-916, 2014. ,
Limited automata and context-free languages, Fund. Inform, vol.136, issue.1-2, pp.157-176, 2015. ,
Limited automata and unary languages, Inform. and Comput, vol.266, pp.60-74, 2019. ,
Nondeterminism and the size of two way finite automata ,
, Proc. 10th Annual ACM Symposium on Theory of Computing (STOC 1978), pp.275-286, 1978.
The reduction of two-way automata to one-way automata, IBM J. Res. Dev, vol.3, issue.2, pp.198-200, 1959. ,
, The On-Line Encyclopedia of Integer Sequences
, , 1986.
Characterization of some classes of context-free languages in terms of complexity classes, MFCS 1975, vol.32, pp.457-461 ,
, , 1975.
A relation between space, return and dual return complexities, Theoret. Comput. Sci, vol.9, issue.79, pp.90010-90010, 1979. ,
Behavioral strengths and weaknesses of various models of limited automata, SOFSEM 2019, vol.11376, pp.519-530, 2019. ,