Five determinisation algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5148 LNCS, Issue , 2008, Pages 161-170

  Van Glabbeek, Rob ^a,b   Ploeger, Bas ^c  

^a CSIRO   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR AUTOMATA; FINITE AUTOMATA; PATTERN RECOGNITION SYSTEMS; ROBOTS; TRANSLATION (LANGUAGES);

ANALYSIS TOOLS; COMPILER THEORY; INTERNATIONAL CONFERENCES; MEMORY USAGE; NON-DETERMINISTIC FINITE AUTOMATA; SYSTEM VERIFICATIONS; TIME EFFICIENCIES;

AUTOMATA THEORY;

EID: 50249107890     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70844-5_17     Document Type: Conference Paper

References (18)

1. Bloom, B., Paige, R.: Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming 24(3), 189-220 (1995)
2. Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of the Symposium on Mathematical Theory of Automata. MRI Symposia Series, vol. 12, pp. 529-561. Polytechnic Press, Polytechnic Institute of Brooklyn (1963)
3. CWI: μCRL Toolset Home Page, http://www.cwi.nl/∼mcrl/
4. Dill, D.L., Hu, A.J., Wong-Toi, H.: Checking for language inclusion using simulation preorders. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 255-265. Springer, Heidelberg (1992)
5. Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation: Coarsest partition problems. Journal of Automated Reasoning 31(1), 73-103 (2003)
6. van Glabbeek, R.J., Ploeger, B.: Correcting a space-efficient simulation algorithm. In: Proc. 20th Int. Conf. on Computer Aided Verification. LNCS. Springer, Heidelberg (to appear, 2008)
7. van Glabbeek, R.J., Ploeger, B.: Five Determinisation Algorithms. CS-Report 08-14, Eindhoven University of Technology (2008)
8. Groote, J.F., Reniers, M.A.: Algebraic process verification. In: Bergstra, J.A., Ponse, A., Smolka,S.A.(eds.)HandbookofProcessAlgebra,pp. 1151-1208.Elsevier,Amsterdam(2001)
9. Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 453-462. IEEE Computer Society Press, Los Alamitos (1995)
10. Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. In: Kohavi, Z. (ed.) Theory of Machines and Computations, pp. 189-196. Academic Press, London (1971)
11. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
12. Park, D.M.R.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Proceedings 5th GI-Conference on Theoretical Computer Science. LNCS, vol. 104, pp. 167-183. Springer, Heidelberg (1981)
13. Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponentialtime. In: Proc. 5thAnnual ACM Symposium on Theory of Computing (STOC 1973), pp. 1-9. ACM, New York (1973)
14. Sutner, K.: The size of power automata. Theor. Comput. Sci. 295(1-3), 371-386 (2003)
15. Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 396-411. Springer, Heidelberg (2005)
16. Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. PhD thesis, Technische Universiteit Eindhoven (1995)
17. Wolfram, S.: Computation theory of cellular automata. Communications in Mathematical Physics 96(1), 15-57 (1984)
18. Wolfram, S.: A New Kind of Science. Wolfram Media, Inc. (2002)