Skip to main content
SpringerLink
Log in

Finite Language Forbidding-Enforcing Systems

  • Conference paper
  • First Online:
Unveiling Dynamics and Complexity (CiE 2017)

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

Included in the following conference series:

  • 618 Accesses

Abstract

The forbidding and enforcing paradigm was introduced by Ehrenfeucht and Rozenberg as a way to define families of languages based on two sets of boundary conditions. Later, a variant of this paradigm was considered where an fe-system defines a single language. We investigate this variant further by studying fe-systems in which both the forbidding and enforcing sets are finite and show that they define regular languages. We prove that the class of languages defined by finite fe-systems is strictly between the strictly locally testable languages and the class of locally testable 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 EPUB and 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

Notes

  1. 1.

    It is called the k-local universal automaton in [16].

References

  1. Bonizzoni, P., Jonoska, N.: Existence of constants in regular splicing languages. Inf. Comput. 242, 340–353 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cavaliere, M., Jonoska, N.: Forbidding and enforcing in membrane computing. Nat. Comput. 2, 215–228 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theoret. Comput. Sci. 27, 311–332 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ehrenfeucht, A., Hoogeboom, H.J., Rozenberg, G., van Vugt, N.: Forbidding and enforcing, In: Winfree, E., Gifford, D.K. (eds.) DNA Based Computers V. AMS DIMACS, Providence, RI, vol. 54, pp. 195–206 (2001)

    Google Scholar 

  5. Ehrenfeucht, A., Hoogeboom, H.J., Rozenberg, G., van Vugt, N.: Sequences of languages in forbidding-enforcing families. Soft. Comput. 5(2), 121–125 (2001)

    Article  MATH  Google Scholar 

  6. Ehrenfeucht, A., Rozenberg, G.: Forbidding-enforcing systems. Theoret. Comput. Sci. 292, 611–638 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fundamenta Informaticae 76, 1–18 (2006)

    MATH  Google Scholar 

  8. Franco, G., Jonoska, N.: Forbidding and enforcing conditions in DNA self-assembly of graphs. In: Chen, J., Jonoska, N., Rozenberg, G. (eds.) Nanotechnology: Science and Computation, Part I. Natural Computing Series, pp. 105–118. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Genova, D.: Defining languages by forbidding-enforcing systems. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds.) CiE 2011. LNCS, vol. 6735, pp. 92–101. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21875-0_10

    Chapter  Google Scholar 

  10. Genova, D.: Forbidding sets and normal forms for language forbidding-enforcing systems. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 289–300. Springer, Heidelberg (2012). doi:10.1007/978-3-642-28332-1_25

    Chapter  Google Scholar 

  11. Genova, D.: Language forbidding-enforcing systems defining DNA codewords. In: Bonizzoni, P., Brattka, V., Löwe, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 220–229. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39053-1_25

    Chapter  Google Scholar 

  12. Genova, D., Jonoska, N.: Defining structures through forbidding and enforcing constraints. Phys. B Condens. Matter 394(2), 306–310 (2007)

    Article  Google Scholar 

  13. Genova, D., Jonoska, N.: Forbidding and enforcing on graphs. Theoret. Comput. Sci. 429, 108–117 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  14. Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull. Math. Biol. 49(6), 737–759 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  15. Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)

    Book  MATH  Google Scholar 

  16. Perrin, D.: Finite automata. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, Formal Models and Semantics, pp. 1–57. Elsevier, Amsterdam (1990)

    Google Scholar 

  17. Rozenberg, G., Bäck, T., Kok, J.N. (eds.): Handbook of Natural Computing, 3 vols. Springer, Heidelberg (2012)

    Google Scholar 

  18. Yu, S.: Regular languages. In: Rozenberg, G., Saloma, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 41–110. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

Download references

Acknowledgement

This paper was started when the first author was visiting Leiden University, while on sabbatical from UNF. The authors thank both institutions for making this possible.

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of North Florida, Jacksonville, FL, 32224, USA

    Daniela Genova

  2. LIACS, Leiden University, Leiden, The Netherlands

    Hendrik Jan Hoogeboom

Authors
  1. Daniela Genova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hendrik Jan Hoogeboom
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daniela Genova .

Editor information

Editors and Affiliations

  1. University of Turku, Turku, Finland

    Jarkko Kari

  2. Christian-Albrechts-University of Kiel, Kiel, Germany

    Florin Manea

  3. Ã…bo Akademi University, Turku, Finland

    Ion Petre

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Genova, D., Hoogeboom, H.J. (2017). Finite Language Forbidding-Enforcing Systems. In: Kari, J., Manea, F., Petre, I. (eds) Unveiling Dynamics and Complexity. CiE 2017. Lecture Notes in Computer Science(), vol 10307. Springer, Cham. https://doi.org/10.1007/978-3-319-58741-7_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-58741-7_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-58740-0

  • Online ISBN: 978-3-319-58741-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation