Skip to main content
SpringerLink
Log in
Book cover

LITP Spring School on Theoretical Computer Science

LITP 1984: Automata on Infinite Words pp 68–80Cite as

A formal proof system for infinitary rational expressions

  • Part II Logic And Automata
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 192))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arnold, M. Nivat, "Comportements de processus" in Colloque AFCET "Les Mathématiques de l'Informatique", pp. 35–68, Paris (1982).

    Google Scholar 

  2. 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 

  3. Ph. Darondeau, L. Kott, "On the observational semantics of fair parallelism", 10th ICALP, Barcelona (1983), LNCS 154 pp. 147–159.

    Google Scholar 

  4. Ph. Darondeau, L. Kott, "Towards a formal proof system for ω-rational expressions", to appear in Inform. Proc. Letter (1984).

    Google Scholar 

  5. S. Eilenberg, "Automata, Languages and Machines" Vol. A, Academic Press, New-York (1974).

    Google Scholar 

  6. 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 

  7. P. Lauer, P. Torrigliani, W. Shields, "COSY, a specification language based on paths and processes", Acta Informatica, 12.

    Google Scholar 

  8. R. Mac Naughton, "Testing and generating infinite sequences by a finite automaton", Information and Control 9, pp. 521–530 (1966).

    Google Scholar 

  9. A. Salomaa, "Theory of Automata", Pergamon Press, Oxford (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA/CNRS, campus de beaulieu, F-35042, rennes cedex

    Ph. Darondeau

  2. IRISA/Université de RENNES I — Campus de Beaulieu, F 35042, Rennes Cedex

    L. Kott

Authors
  1. Ph. Darondeau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Kott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Nivat D. Perrin

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Darondeau, P., Kott, L. (1985). A formal proof system for infinitary rational expressions. In: Nivat, M., Perrin, D. (eds) Automata on Infinite Words. LITP 1984. Lecture Notes in Computer Science, vol 192. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15641-0_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-15641-0_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15641-3

  • Online ISBN: 978-3-540-39505-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation