Concurrency and automata on infinite sequences

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

Volumn 104 LNCS, Issue , 1981, Pages 167-183

  Park, David ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONCURRENCY OPERATORS; FIXPOINTS; GENERAL METHOD; RECURSION EQUATIONS;

AUTOMATA THEORY;

EID: 84945924340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0017309     Document Type: Conference Paper

References (13)

1. Brzozowski, J.A. Derivatives of regular expressions. J. ACM 11, 481–494 (1964)
2. Büchi, J.R. Weak second order arithmetic and finite automata. Z. Math. Logik u Grund. Math. 6, 66–92 (1960).
3. Büchi, J.R. On a decision method in restricted second order arithmetic. Proc. Int. Congr. Logic, Method., Phil. of Sci. 1960. Stanford U. Press, 1962.
4. Choueka, Y. Theories of automata on ω-tapes: a simplified approach. J. Comp. Sys. Sci. 8, 117–141 (1974).
5. Ginzburg, A. A procedure for checking equality of regular expressions. J. ACM 14, 355–362 (1967).
6. Ginzburg, A. “Algebraic Theory of Automata.” Academic Press 1968.
7. Landweber, L. Decision problems for omega-automata. Math. Sys. Thy. 3 376–384 (1969).
8. McNaughton, R. Testing and generating infinite sequences by a finite automaton. Inf. & Control 9, 521–530 (1966).
9. Muller, D.E. Infinite sequences and finite machines. Proc. 4th Ann. Symp. on Switching Circuit Theory and Logical Design, 3–16. IEEE 1963.
10. Milner, R. An algebraic definition of simulation between programs. Proc. 2nd Int. Joint. Conf. on Artificial Intelligence. British Comp. Soc. 1971.
11. Park, D. On the semantics of fair parallelism. 504–526 in “Abstract Software Specifications” (Proc. 1979 Copenhagen Winter School) ed. D. Bjørner. Springer Lec. Notes in Comp. Sci. 86. (1980).
12. Rabin, M. & Scott, D. Finite automata and their decision problems. IBM J of Res. & Dev. 3, 114–125 (1959).
13. Salomaa, A. Two complete axiom systems for the algebra of regular events. J. ACM 13, 158–169 (1966).