Theory of Computing Systems

, Volume 60, Issue 3, pp 438–472 | Cite as

On Boolean Closed Full Trios and Rational Kripke Frames

Article

Abstract

We study what languages can be constructed from a non-regular language L using Boolean operations and synchronous or non-synchronous rational transductions. If all rational transductions are allowed, one can construct the whole arithmetical hierarchy relative to L. In the case of synchronous rational transductions, we present non-regular languages that allow constructing languages arbitrarily high in the arithmetical hierarchy and we present non-regular languages that allow constructing only recursive languages. A consequence of the results is that aside from the regular languages, no full trio generated by a single language is closed under complementation. Another consequence is that there is a fixed rational Kripke frame such that assigning an arbitrary non-regular language to some variable allows the definition of any language from the arithmetical hierarchy in the corresponding Kripke structure using multimodal logic.

Keywords

Regular languages Closure properties Trio operations Boolean operations Synchronous rational transductions Arithmetical hierarchy Rational Kripke structures 

References

  1. 1.
    Barceló, P., Figueira, D., Libkin, L.: Graph Logics with Rational Relations and the Generalized Intersection Problem. In: Proceedings of the 27Th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2012), pp 115–124. IEEE Computer Society (2012)Google Scholar
  2. 2.
    Bekker, W., Goranko, V.: Symbolic Model Checking of Tense Logics on Rational Kripke Models. In: Selected Papers of the International Conference on Infinity and Logic in Computation (ILC 2007), Lecture Notes in Computer Science, pp 2–20. Springer-Verlag (2009)Google Scholar
  3. 3.
    Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)CrossRefMATHGoogle Scholar
  4. 4.
    Blackburn, P., De Rijke, M., Venema, Y.: Modal logic. Cambridge University Press (2001)Google Scholar
  5. 5.
    Book, R.V.: Simple representations of certain classes of languages. J. ACM 25 (1), 23–31 (1978)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Carayol, A., Morvan, C.: On Rational Trees. In: Proceedings of the 15Th Annual EACSL Conference on Computer Science Logic (CSL 2006), Volume 4207 of Lecture Notes in Computer Science, pp 225–239. Springer-Verlag (2006)Google Scholar
  7. 7.
    Carton, O., Thomas, W.: The monadic theory of morphic infinite words and generalizations. Inf. Comput. 176(1), 51–65 (2002)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Chomsky, N., Schützenberger, M.-P.: The algebraic theory of context-free languages. North-Holland, Amsterdam (1963)CrossRefMATHGoogle Scholar
  9. 9.
    Damm, W.: The IO- and OI-hierarchies. Theor. Comput. Sci. 20(2), 95–207 (1982)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Damm, W., Goerdt, A.: An automata-theoretical characterization of the OI-hierarchy. Inf. Control. 71(1–2), 1–32 (1986)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Dassow, J., Păun, G.: Regulated rewriting in formal language theory. Springer-verlag, Berlin Heidelberg (1989)CrossRefMATHGoogle Scholar
  12. 12.
    Elgot, C.C., Rabin, M.O.: Decidability and undecidability of extensions of second (first) order theory of (generalized) successor. J. Symb. Log. 31(2), 169–181 (1966)CrossRefMATHGoogle Scholar
  13. 13.
    Engelfriet, J., Rozenberg, G.: Fixed point languages, equality languages, and representation of recursively enumerable languages. J. ACM 27(3), 499–518 (1980)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Fernau, H., Stiebe, R.: Sequential grammars and automata with valences. Theor. Comput. Sci. 276, 377–405 (2002)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Frougny, C., Sakarovitch, J.: Synchronized rational relations of finite and infinite words. Theor. Comput. Sci. 108(1), 45–82 (1993)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Geeraerts, G., Raskin, J.-F., Van Begin, L.: Well-structured languages. Acta Inf. 44(3–4), 249–288 (2007)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Ginsburg, S., Goldstine, J.: Intersection-closed full AFL and the recursively enumerable languages. Inf. Control. 22(3), 201–231 (1973)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Greibach, S.A.: Remarks on blind and partially blind one-way multicounter machines. Theor. Comput. Sci. 7(3), 311–324 (1978)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Harju, T., Karhumäki, J., Krob, D.: Remarks on Generalized Post Correspondence Problem. In: Proceedings of the 13Th International Symposium on Theoretical Aspects of Computer Science (STACS 1996), Volume 1046 of Lecture Notes in Computer Science, pp 39–48. Springer-Verlag (1996)Google Scholar
  20. 20.
    Hartmanis, J., Hopcroft, J.: What makes some language theory problems undecidable. J. Comput. Syst. Sci. 4(4), 368–376 (1970)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Haussler, D., Zeiger, H.P.: Very special languages and representations of recursively enumerable languages via computation histories. Inf. Control. 47(3), 201–212 (1980)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Hopcroft, J.E., Ullman, J. D.: Introduction to Automata Theory, Languages and Computation. Addison–Wesley, Reading, MA (1979)MATHGoogle Scholar
  23. 23.
    Jantzen, M., Kurganskyy, A.: Refining the hierarchy of blind multicounter languages and twist-closed trios. Inf. Comput. 185(2), 159–181 (2003)MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    Khoussainov, B., Nerode, A.: Automatic Presentations of Structures. In: LCC: International Workshop on Logic and Computational Complexity, Volume 960 of Lecture Notes in Computer Science, pp 367–392. Springer-Verlag (1995)Google Scholar
  25. 25.
    Kleene, S. C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp 3–41. Princeton University Press, Princeton, NJ (1956)Google Scholar
  26. 26.
    Lohrey, M., Zetzsche, G.: On Boolean closed full trios and rational Kripke frames. In: Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), volume 25 of Leibniz International Proceedings in Informatics (LIPIcs), pp 530-541. Schloss DagstuhlLeibniz-Zentrum für Informatik, Dagstuhl, Germany (2014)Google Scholar
  27. 27.
    Minsky, M.: Recursive unsolvability of Post’s problem of `tag’ and other topics in theory of Turing machines. Ann. Math. 74(3), 437–455 (1961)MathSciNetCrossRefMATHGoogle Scholar
  28. 28.
    Morvan, C.: On rational graphs. In: Proceedings of the 3Rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2000), Volume 2303 of Lecture Notes in Computer Science, pp 252–266. Springer-Verlag (2000)Google Scholar
  29. 29.
    Morvan, C., Stirling, C.: Rational Graphs Trace Context-Sensitive Languages. In: Proceedings of the 26Th International Symposium on Mathematical Foundations of Computer Science (MFCS 2001), Volume 2136 of Lecture Notes in Computer Science, pp 548–559. Springer-Verlag (2001)Google Scholar
  30. 30.
    Nivat, M.: Transductions des langages de Chomsky. Ann. l’Institut Fourier 18 (1), 339–455 (1968)MathSciNetCrossRefMATHGoogle Scholar
  31. 31.
    Pin, J.-É., Sakarovitch, J.: Some Operations and Transductions that Preserve Rationality. In: Proceedings of the 6Th GI Conference, Volume 145 of Lecture Notes in Computer Science, pp 277–288. Springer-Verlag (1983)Google Scholar
  32. 32.
    Rabinovich, A.: On decidability of monadic logic of order over the naturals extended by monadic predicates. Inf. Comput. 205, 870–889 (2007)MathSciNetCrossRefMATHGoogle Scholar
  33. 33.
    Rabinovich, A., Thomas, W.: Decidable theories of the ordering of natural numbers with unary predicates. In: Proceedings of the 15th Annual EACSL Conference on Computer Science Logic (CSL 2006), volume 4207 of Lecture Notes in Computer Science, pp 562-574. Springer-Verlag, Berlin Heidelberg (2006)Google Scholar
  34. 34.
    Reinhardt, K.: The “trio-zoo”–classes of formal languages generated from one language by rational transduction. Unpublished manuscriptGoogle Scholar
  35. 35.
    Render, E.: Rational monoid and semigroup automata. PhD Thesis, University of Manchester (2010)Google Scholar
  36. 36.
    Rogers, H.: Theory of recursive functions and effective computability. McGraw-Hill (1968)Google Scholar
  37. 37.
    Seibert, S.: Quantifier hierarchies over word relations. In: Proceedings of the 5Th Annual EACSL Conference on Computer Science Logic (CSL 1991), Volume 626 of Lecture Notes in Computer Science, pp 329–352. Springer-Verlag (1992)Google Scholar
  38. 38.
    Semenov, A.: Decidability of monadic theories. In: Proceedings of the 11Th International Symposium on Mathematical Foundations of Computer Science (MFCS 1984), Volume 176 of Lecture Notes in Computer Science, pp 162–175. Springer-Verlag (1984)Google Scholar
  39. 39.
    Thomas, W.: A Short Introduction to Infinite Automata. In: Proceedings of the 5Th International Conference on Developments in Language Theory (DLT 2001), Volume 2295 of Lecture Notes in Computer Science, pp 130–144. Springer-Verlag (2001)Google Scholar
  40. 40.
    Zetzsche, G.: On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids. In: Proceedings of the 38Th International Colloquium on Automata, Languages and Programming (ICALP 2011), Volume 6756 of Lecture Notes in Computer Science, pp 222–233. Springer-Verlag (2011)Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Fachbereich InformatikTechnische Universität KaiserslauternKaiserslauternGermany
  2. 2.Institut für Theoretische InformatikTechnische Universität IlmenauIlmenauGermany
  3. 3.Department für Elektrotechnik und InformatikUniversität SiegenSiegenGermany

Personalised recommendations