Part of the Lecture Notes in Computer Science book series (LNCS, volume 192)
A formal proof system for infinitary rational expressions
KeywordsInference Rule Proof System Induction Rule Empty Word Finite Alphabet
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [AN]A. Arnold, M. Nivat, "Comportements de processus" in Colloque AFCET "Les Mathématiques de l'Informatique", pp. 35–68, Paris (1982).Google Scholar
- [Bu]J. Büchi, "On a decision method in restricted second order arithmetics", Int. Cong. of Logic, Method. Phil. Science, Stanford Univ.Press (1962).Google Scholar
- [DK1]Ph. Darondeau, L. Kott, "On the observational semantics of fair parallelism", 10th ICALP, Barcelona (1983), LNCS 154 pp. 147–159.Google Scholar
- [DK2]Ph. Darondeau, L. Kott, "Towards a formal proof system for ω-rational expressions", to appear in Inform. Proc. Letter (1984).Google Scholar
- [Ei]S. Eilenberg, "Automata, Languages and Machines" Vol. A, Academic Press, New-York (1974).Google Scholar
- [IIN]H. Izumi, Y. Inagaki, N. Honda, "A complete axiom system for algebra of closed-regular expressions", 11th ICALP, Antwerp (1984), LNCS 17 pp.260–269.Google Scholar
- [LTS]P. Lauer, P. Torrigliani, W. Shields, "COSY, a specification language based on paths and processes", Acta Informatica, 12.Google Scholar
- [MN]R. Mac Naughton, "Testing and generating infinite sequences by a finite automaton", Information and Control 9, pp. 521–530 (1966).Google Scholar
- [Sa]A. Salomaa, "Theory of Automata", Pergamon Press, Oxford (1969).Google Scholar
© Springer-Verlag Berlin Heidelberg 1985