Skip to main content
SpringerLink
Log in

Non-recursive Trade-offs between Two-Dimensional Automata and Grammars

  • Conference paper
Descriptional Complexity of Formal Systems (DCFS 2014)

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

Included in the following conference series:

Abstract

We study succinctness of descriptional systems for picture languages. Basic models of two-dimensional finite automata and generalizations of context-free grammars are considered. It is shown that non-recursive trade-offs between the systems are very common. The results are based on the ability of the systems to simulate Turing machines.

The author was supported by the Grant Agency of the Czech Republic under the project P103/10/0783.

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. Blum, M., Hewitt, C.: Automata on a 2-dimensional tape. In: FOCS 1967 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), pp. 155–160. IEEE Computer Society, Washington, DC (1967)

    Chapter  Google Scholar 

  2. Cherubini, A., Crespi Reghizzi, S., Pradella, M.: Regional languages and tiling: A unifying approach to picture grammars. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 253–264. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 215–267. Springer, New York (1997)

    Chapter  Google Scholar 

  4. Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Inf. Sci. 13(2), 95–121 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kari, J., Moore, C.: New results on alternating and non-deterministic two-dimensional finite-state automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 396–406. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Kari, J., Moore, C.: Rectangles and squares recognized by two-dimensional automata. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds.) Theory Is Forever (Salomaa Festschrift). LNCS, vol. 3113, pp. 134–144. Springer, Heidelberg (2004)

    Google Scholar 

  7. Kutrib, M.: The phenomenon of non-recursive trade-offs. International Journal of Foundations of Computer Science 16(05), 957–973 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: SWAT (FOCS). pp. 188–191. IEEE Computer Society (1971)

    Google Scholar 

  9. Matz, O.: Regular expressions and context-free grammars for picture languages. In: Reischuk, R., Morvan, M. (eds.) STACS 1997 Proceedings. LNCS, vol. 1200, pp. 283–294. Springer, Heidelberg (1997)

    Google Scholar 

  10. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Inc. (1967)

    Google Scholar 

  11. Pighizzini, G., Shallit, J., Wang, M.: Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. Journal of Computer and System Sciences 65(2), 393–414 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Průša, D.: Two-dimensional Languages. Ph.D. thesis, Faculty of Mathematics and Physics. Charles University, Prague, Czech Republic (2004)

    Google Scholar 

  13. Radó, T.: On non-computable functions. Bell System Technical Journal 41(3), 877–884 (1962)

    Article  MathSciNet  Google Scholar 

  14. Siromoney, G., Siromoney, R., Krithivasan, K.: Abstract families of matrices and picture languages. Computer Graphics and Image Processing 1(3), 284–307 (1972)

    Article  MathSciNet  Google Scholar 

  15. Siromoney, G., Siromoney, R., Krithivasan, K.: Picture languages with array rewriting rules. Information and Control 22(5), 447–470 (1973)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical Engineering, Czech Technical University, Karlovo náměstí 13, 121 35, Prague 2, Czech Republic

    Daniel Průša

Authors
  1. Daniel Průša
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, Ontario, Canada

    Helmut Jürgensen

  2. Department of Mathematics and TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  3. University of Turku, Fi-20014, Turku, Finland

    Alexander Okhotin

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Průša, D. (2014). Non-recursive Trade-offs between Two-Dimensional Automata and Grammars. In: Jürgensen, H., Karhumäki, J., Okhotin, A. (eds) Descriptional Complexity of Formal Systems. DCFS 2014. Lecture Notes in Computer Science, vol 8614. Springer, Cham. https://doi.org/10.1007/978-3-319-09704-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09704-6_31

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09703-9

  • Online ISBN: 978-3-319-09704-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation