Author:
Hromkovič Juraj,Seibert Sebastian,Wilke Thomas
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Ronald Book, Shimon Even, Sheila Greibach, and Gene Ott. Ambiguity in graphs and expressions. IEEE Trans. Comput, C-20(2):149–153, 1971.
2. Anne Brüggemann-Klein. Regular expressions into finite automata. Theoret. Comput. Sci., 120:197–213, 1993.
3. Andrzej Ehrenfeucht and Paul Zeiger. Complexity measures for regular expressions. J. Comput. System Sci., 12:134–146, 1976.
4. V. M. Glushkov. The abstract theory of automata. Russian Math. Surveys, 16:1–53, 1961. Translation from Usp. Mat. Naut. 16:3–41, 1961 by J. M. Jackson.
5. John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, Mass., 1979.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast Matching of Regular Patterns with Synchronizing Counting;Lecture Notes in Computer Science;2023
2. Biclique Coverings, Rectifier Networks and the Cost of ε-Removal;Descriptional Complexity of Formal Systems;2014
3. Distributed XML design;Journal of Computer and System Sciences;2011-11
4. Distributed XML design;Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '09;2009
5. On the Average Size of Glushkov’s Automata;Language and Automata Theory and Applications;2009