Skip to main content
SpringerLink
Log in

Measuring Power of Generalised Definite Languages

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2023)

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

Included in the following conference series:

  • 173 Accesses

Abstract

A language \(L\) is said to be \(\mathcal{C}\)-measurable, where \(\mathcal{C}\) is a class of languages, if there is an infinite sequence of languages in \(\mathcal{C}\) that “converges” to \(L\). In this paper, we investigate the measuring power of \(\textrm{GD}\) of the class of all generalised definite languages. Although each generalised definite language only can check some local property (prefix and suffix of some bounded length), it is shown that many non-generalised-definite languages are \(\textrm{GD}\)-measurable. Further, we show that it is decidable whether a given regular language is \(\textrm{GD}\)-measurable or not.

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 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.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

References

  1. Adámek, J., Milius, S., Myers, R.S.R., Urbat, H.: Generalized Eilenberg theorem I: local varieties of languages. In: Muscholl, A. (ed.) FoSSaCS 2014. LNCS, vol. 8412, pp. 366–380. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54830-7_24

    Chapter  MATH  Google Scholar 

  2. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata, Encyclopedia of mathematics and its applications, vol. 129. Cambridge University Press (2010)

    Google Scholar 

  3. Brzozowski, J.: Canonical regular expressions and minimal state graphs for definite events. Math. Theor. Automata 12, 529–561 (1962)

    Google Scholar 

  4. Brzozowski, J.: On Aperiodic I-monoids. Department of Computer Science. University of Waterloo. Research Report CS-75-28 (1975)

    Google Scholar 

  5. Brzozowski, J., Simon, I.: Characterizations of locally testable events. Discrete Math. 4, 243–271 (1973)

    Google Scholar 

  6. Flajolet, P., Sedgewick, R.: Analytic Combinatorics, 1st edn. Cambridge University Press, New York (2009)

    Book  MATH  Google Scholar 

  7. Ginzburg, A.: About some properties of definite, reverse-definite and related automata. IEEE Trans. Electron. Comput. EC–15(5), 806–810 (1966)

    Article  MATH  Google Scholar 

  8. Lawson, M.V.: Finite Automata. Chapman and Hall/CRC (2004)

    Google Scholar 

  9. McNaughton, R.: Algebraic decision procedures for local testability. Math. Syst. Theor. 8, 60–76 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  10. Place, T., Zeitoun, M.: Separating regular languages with first-order logic. Log. Meth. Comput. Sci. 12(1) (2016)

    Google Scholar 

  11. Salomaa, A., Soittola, M.: Automata Theoretic Aspects of Formal Power Series. Springer, New York (1978). https://doi.org/10.1007/978-1-4612-6264-0

  12. Simon, I.: Piecewise testable events. In: Automata Theory and Formal Languages, pp. 214–222 (1975)

    Google Scholar 

  13. Sin’ya, R.: An automata theoretic approach to the zero-one law for regular languages. In: Games, Automata, Logics and Formal Verification, pp. 172–185 (2015)

    Google Scholar 

  14. Sin’ya, R.: Asymptotic approximation by regular languages. In: Current Trends in Theory and Practice of Computer Science, pp. 74–88 (2021)

    Google Scholar 

  15. Sin’ya, R.: Carathéodory extensions of subclasses of regular languages. In: Developments in Language Theory, pp. 355–367 (2021)

    Google Scholar 

  16. Sin’ya, R.: Measuring power of locally testable languages. In: Diekert, V., Volkov, M. (eds.) Developments in Language Theory, DLT 2022. LNCS, vol. 13257, pp. 274–285. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-05578-2_22

  17. Sin’ya, R., Yamaguchi, Y., Nakamura, Y.: Regular languages that can be approximated by testing subword occurrences. Comput. Softw. 40(2), 49–60 (2023). (written in Japanese)

    Google Scholar 

  18. Zalcstein, Y.: Locally testable languages. J. Comput. Syst. Sci. 6(2), 151–167 (1972)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

I am grateful to Mark V. Lawson whose helpful discussions were extremely valuable. The author also thank to anonymous reviewers for many valuable comments. This work was supported by JST ACT-X Grant Number JPMJAX210B, Japan.

Author information

Authors and Affiliations

  1. Akita University, Akita, Japan

    Ryoma Sin’ya

Authors
  1. Ryoma Sin’ya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ryoma Sin’ya .

Editor information

Editors and Affiliations

  1. Eastern Mediterranean University, Famagusta, Cyprus

    Benedek Nagy

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sin’ya, R. (2023). Measuring Power of Generalised Definite Languages. In: Nagy, B. (eds) Implementation and Application of Automata. CIAA 2023. Lecture Notes in Computer Science, vol 14151. Springer, Cham. https://doi.org/10.1007/978-3-031-40247-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-40247-0_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-40246-3

  • Online ISBN: 978-3-031-40247-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation