Skip to main content
SpringerLink
Log in

Automaton Representation of Linear Conjunctive Languages

  • 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

Triangular trellis automata, also studied under the name of one-way real-time cellular automata, have been known for several decades as a purely abstract model of parallel computers. This paper establishes their computational equivalence to linear conjunctive grammars, which are linear context-free grammars extended with an explicit intersection operation. This equivalence allows to combine the known results on the generative power and closure properties of triangular trellis automata and linear conjunctive grammars and to obtain new previously unexpected results on this language family — for instance, to determine their exact relationship with other comparable families of languages.

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. C. Choffrut and K. Culik II, “On real-time cellular automata and trellis automata”, Acta Informatica, 21 (1984), 393–407.

    Article  MATH  MathSciNet  Google Scholar 

  2. K. Culik II, J. Gruska and A. Salomaa, “Systolic trellis automata” (I, II), International Journal of Computer Mathematics, 15 (1984) 195–212; 16 (1984) 3-22.

    Article  MATH  MathSciNet  Google Scholar 

  3. C. Dyer, ”One-way bounded cellular automata”, Information and Control, 44 (1980), 261–281.

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  5. A. Okhotin, “A recognition and parsing algorithm for arbitrary conjunctive grammars”, Theoretical Computer Science, to appear.

    Google Scholar 

  6. A. Okhotin, “On the closure properties of linear conjunctive languages”, Theoretical Computer Science, to appear.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. V. Terrier, “On real-time one-way cellular array”, Theoretical Computer Science, 141 (1995), 331–335.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Queen’s University, K7L 3N6, Ontario, Kingston, Canada

    Alexander Okhotin

Authors
  1. Alexander Okhotin
    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

Okhotin, A. (2003). Automaton Representation of Linear Conjunctive Languages. 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_35

Download citation

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

  • 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