Author:
Brandl Christian,Simon Hans Ulrich
Publisher
Springer International Publishing
Reference11 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Cho, S., Huynh, D.T.: Finite-Automaton Aperiodicity is PSPACE-Complete. Theor. Comput. Sci. 88(1), 99–116 (1991)
3. Lecture Notes in Computer Science;T Colcombet,2011
4. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)
5. Kozen, D.: Lower bounds for natural proof systems. In: 18th Annual Symposium on Foundations of Computer Science, pp. 254–266. IEEE Computer Society, Washington (1977)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The complexity of properties of transformation semigroups;International Journal of Algebra and Computation;2019-12-06
2. Green’s Relations in Deterministic Finite Automata;Theory of Computing Systems;2018-02-12
3. Green’s Relations in Finite Transformation Semigroups;Computer Science – Theory and Applications;2017
4. Completely Reachable Automata;Descriptional Complexity of Formal Systems;2016