Skip to main content
SpringerLink
Log in

A Simple P-Complete Problem and Its Representations by Language Equations

  • Conference paper
Machines, Computations, and Universality (MCU 2007)

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

Included in the following conference series:

  • 608 Accesses

Abstract

A variant of Circuit Value Problem over the basis of Peirce’s arrow (NOR) is introduced, in which one of the inputs of every k-th gate must be the (k − 1)-th gate. The problem, which remains P-complete, is encoded as a simple formal language over a two-letter alphabet. It is shown that this language can be naturally and succinctly represented by language equations from several classes. Using this representation, a small conjunctive grammar and an even smaller LL(1) Boolean grammar for this language are constructed.

Supported by the Academy of Finland under grants 118540 and 206039.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Autebert, J., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. I, pp. 111–174. Springer, Heidelberg (1997)

    Google Scholar 

  2. Ford, B.: Parsing expression grammars: a recognition-based syntactic foundation. In: Proceedings of POPL 2004, Venice, Italy, January 14–16, 2004, pp. 111–122 (2004)

    Google Scholar 

  3. Galil, Z.: Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages. Mathematical Systems Theory 10(3), 211–228 (1977) (Earlier version In: 15th Annual Symposium on Automata and Switching Theory (1974))

    Google Scholar 

  4. Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. Journal of the ACM 9, 350–371 (1962)

    Article  MathSciNet  Google Scholar 

  5. Goldschlager, L.M.: The monotone and planar circuit value problems are log space complete for P. SIGACT News 9(2), 25–29 (1977)

    Article  Google Scholar 

  6. Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford (1995)

    MATH  Google Scholar 

  7. Ibarra, O.H., Kim, S.M.: Characterizations and computational complexity of systolic trellis automata. Theoretical Computer Science 29, 123–153 (1984)

    Article  MathSciNet  Google Scholar 

  8. Kountouriotis, V., Nomikos, C., Rondogiannis, P.: Well-founded semantics for Boolean grammars. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 203–214. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Ladner, R.E.: The circuit value problem is log space complete for P. SIGACT News 7(1), 18–20 (1975)

    Article  MathSciNet  Google Scholar 

  10. Neary, T., Woods, D.: P-completeness of cellular automaton rule 110. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 132–143. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics 6(4), 519–535 (2001)

    MATH  MathSciNet  Google Scholar 

  12. Okhotin, A.: Conjunctive grammars and systems of language equations. Programming and Computer Software 28, 243–249 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  13. Okhotin, A.: The hardest linear conjunctive language. Information Processing Letters 86(5), 247–253 (2003)

    Article  MathSciNet  Google Scholar 

  14. Okhotin, A.: Decision problems for language equations with Boolean operations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 239–251. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Okhotin, A.: Boolean grammars. Information and Computation 194(1), 19–48 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  16. Okhotin, A.: Recursive descent parsing for Boolean grammars. Acta Informatica (to appear)

    Google Scholar 

  17. Okhotin, A.: The dual of concatenation. Theoretical Computer Science 345(2-3), 425–447 (2005)

    Google Scholar 

  18. Okhotin, A.: Nine open problems for conjunctive and Boolean grammars. Bulletin of the EATCS 91, 96–119 (2007)

    MathSciNet  Google Scholar 

  19. Rogozhin, Y.: Small universal Turing machines. Theoretical Computer Science 168(2), 215–240 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  20. Sudborough, I.H.: A note on tape-bounded complexity classes and linear context-free languages. Journal of the ACM 22(4), 499–500 (1975)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Academy of Finland and, Department of Mathematics, University of Turku, FIN-20014 Turku, Finland

    Alexander Okhotin

Authors
  1. Alexander Okhotin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jérôme Durand-Lose Maurice Margenstern

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Okhotin, A. (2007). A Simple P-Complete Problem and Its Representations by Language Equations. In: Durand-Lose, J., Margenstern, M. (eds) Machines, Computations, and Universality. MCU 2007. Lecture Notes in Computer Science, vol 4664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74593-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74593-8_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74592-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation