Skip to main content
SpringerLink
Log in

Tiling Systems over Infinite Pictures and Their Acceptance Conditions

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2002)

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

Included in the following conference series:

Abstract

Languages of infinite two-dimensional words (ω-pictures) are studied in the automata theoretic setting of tiling systems. We show that a hierarchy of acceptance conditions as known from the theory of ω- languages can be established also over pictures. Since the usual pumping arguments fail, new proof techniques are necessary. Finally, we show that (unlike the case of ω-languages) none of the considered acceptance conditions leads to a class of infinitary picture languages which is closed under complementation.

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. Y. Choueka. Finite automata, definable sets, and regular expressions over ωn-tapes. Computer and System Sciences, 17:81–97, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. Engelfriet and H. Hoogeboom. X-automata on ω-words. Theoretical Computer Science, 110:1–51, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Giammarresi and A. Restivo. Two-dimensional languages. In Handbook of Formal Languages, vol. III, pages 215–267. 1997.

    MathSciNet  Google Scholar 

  4. D. Giammarresi, A. Restivo, S. Seibert, and W. Thomas. Monadic second-order logic over rectangular pictures and recognizability by tiling systems. Information and Computation, 125(1):32–45, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. Harel. Recurring dominoes: Making the highly undecidable highly understandable. Annals of Discrete Mathematics, 24:51–72, 1985.

    MATH  MathSciNet  Google Scholar 

  6. M. Kaminski and S. Pinter. Finite automata on directed graphs. Computer and System Sciences, 44:425–446, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  7. L. Landweber. Decision problems for ω-automata. Mathematical Systems Theory, 3:376–384, 1969.

    Article  MATH  MathSciNet  Google Scholar 

  8. H. Rogers. Theory of Recursive Functions and Effiective Computability. McGraw-Hill. New York, 1967.

    Google Scholar 

  9. L. Staiger. Research in the theory of ω-languages. Information Processing and Cybernetics EIK, 23:415–439, 1987.

    MATH  MathSciNet  Google Scholar 

  10. W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, vol. B, pages 133–192. Amsterdam, 1990.

    Google Scholar 

  11. K. Wagner. On ω-regular sets. Information and Control, 43(2):123–177, 1979.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik VII RWTH Aachen, 52056, Aachen, Germany

    Jan-Henrik Altenbernd, Wolfgang Thomas & Stefan Wöhrle

Authors
  1. Jan-Henrik Altenbernd
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Wöhrle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Altenbernd, JH., Thomas, W., Wöhrle, S. (2003). Tiling Systems over Infinite Pictures and Their Acceptance Conditions. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40431-6

  • Online ISBN: 978-3-540-45005-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation