Skip to main content
SpringerLink
Log in

Stratified Boolean Grammars

  • Conference paper
Book cover Mathematical Foundations of Computer Science 2005 (MFCS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3618))

Abstract

We study Boolean grammars. We introduce stratified semantics for Boolean grammars. We show, how to check, if a Boolean grammar generates a language according to this semantics. We show, that stratified semantics covers a class of important and natural languages. We introduce a recognition algorithm for Boolean grammars compliant to this semantics.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andersen, H.R.: Model Checking and Boolean Graphs. Theor. Comput. Sci. 1(126), 3–30 (1994)

    Article  Google Scholar 

  2. Chandra, A.K., Harel, D.: Horn Clauses and the Fixpoint Query Hierarchy. In: Proceedings of the ACM Symposium on Principles of Database Systems, Los Angeles, California, March 29-31 1982, pp. 158–163 (1982)

    Google Scholar 

  3. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. Journal of ACM 47(2), 312–360 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Okhotin, A.: A Boolean grammar for a simple programming language. Technical Report 2004-478, School of Computing, Queen’s University, Kingston, Ontario, Canada

    Google Scholar 

  5. Okhotin, A.: Boolean grammars. Developments in Language Theory, 398–410 (2003)

    Google Scholar 

  6. Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal of Computing 1(2), 146–160 (1972)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław,  

    Michał Wrona

Authors
  1. Michał Wrona
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Gdansk University, Wita Stwosza 57, 80 952, Gdansk, Poland

    Joanna Jȩdrzejowicz  & Andrzej Szepietowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wrona, M. (2005). Stratified Boolean Grammars. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_69

Download citation

  • DOI: https://doi.org/10.1007/11549345_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28702-5

  • Online ISBN: 978-3-540-31867-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation