Author:
Pighizzini Giovanni,Prigioniero Luca
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference25 articles.
1. A generalization of context-free determinism;Hibbard;Inf. Control,1967
2. Computational Complexity;Wagner,1986
3. Limited automata and regular languages;Pighizzini;Int. J. Found. Comput. Sci.,2014
4. Limited automata and context-free languages;Pighizzini;Fundam. Inform.,2015
5. Descriptional complexity of limited automata;Kutrib;Inf. Comput.,2018
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Performing Regular Operations with 1-Limited Automata;Theory of Computing Systems;2024-03-14
2. Modeling and Application of Yin-Yang Theory of Traditional Chinese Medicine Based on Automata;2023 2nd International Conference on Machine Learning, Control, and Robotics (MLCR);2023-12-09
3. Forgetting 1-Limited Automata;Electronic Proceedings in Theoretical Computer Science;2023-09-15
4. Once-Marking and Always-Marking 1-Limited Automata;Electronic Proceedings in Theoretical Computer Science;2023-09-03
5. Between SC and LOGDCFL: families of languages accepted by logarithmic-space deterministic auxiliary depth-k storage automata;International Journal of Computer Mathematics: Computer Systems Theory;2023-01-02