References

1. J. A. Brzozowski (1962): Regular Expression Techniques for Sequential Circuits. Princeton University, Princeton, NJ, USA.
2. J. A. Brzozowski, G. Jirásková & C. Zou (2014): Quotient complexity of closed languages. Theory of Computing Systems 54, pp. 277–292, doi:10.1007/s00224-013-9515-7.
3. Jürgen Dassow (1979): On the Circular Closure of Languages. Elektronische Informationsverarbeitung und Kybernetik/Journal of Information Processing and Cybernetics 15(1–2), pp. 87–94.
4. Jürgen Dassow (2005): Contextual grammars with subregular choice. Fundamenta Informaticae 64(1–4), pp. 109–118.
5. Jürgen Dassow (2015): Contextual languages with strictly locally testable and star free selection languages. Analele Universitătii Bucuresti 62, pp. 25–36.
6. Jürgen Dassow (2018): Grammars with control by ideals and codes. Journal of Automata, Languages and Combinatorics 23(1–3), pp. 143–164, doi:10.25596/jalc-2018-143.
7. Jürgen Dassow (2021): Remarks on external contextual grammars with selection. Theoretical Computer Science 862, pp. 119–129, doi:10.1016/j.tcs.2020.07.028.
8. Jürgen Dassow, Florin Manea & Bianca Truthe (2011): On Contextual Grammars with Subregular Selection Languages. In: Markus Holzer, Martin Kutrib & Giovanni Pighizzini: Descriptional Complexity of Formal Systems – 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25\,–\,27, 2011. Proceedings, LNCS 6808. Springer-Verlag, pp. 135–146, doi:10.1007/978-3-642-22600-7_11.
9. Jürgen Dassow, Florin Manea & Bianca Truthe (2012): On External Contextual Grammars with Subregular Selection Languages. Theoretical Computer Science 449(1), pp. 64–73, doi:10.1016/j.tcs.2012.04.008.
10. Jürgen Dassow, Florin Manea & Bianca Truthe (2012): On Subregular Selection Languages in Internal Contextual Grammars. Journal of Automata, Languages, and Combinatorics 17(2–4), pp. 145–164, doi:10.25596/jalc-2012-145.
11. F. Gécseg & I. Peak (1972): Algebraic Theory of Automata. Academiai Kiado, Budapest.
12. A. Gill & L. T. Kou (1974): Multiple-entry finite automata. Journal of Computer and System Sciences 9(1), pp. 1–19, doi:10.1016/S0022-0000(74)80034-6.
13. Ivan M. Havel (1969): The theory of regular events II. Kybernetika 5(6), pp. 520–544.
14. Markus Holzer & Bianca Truthe (2015): On Relations Between Some Subregular Language Families. In: Rudolf Freund, Markus Holzer, Nelma Moreira & Rogério Reis: Seventh Workshop on Non-Classical Models of Automata and Applications (NCMA), Porto, Portugal, August 31 – September 1, 2015, Proceedings, books@ocg.at 318. Österreichische Computer Gesellschaft, pp. 109–124.
15. Sorin Istrail (1978): Gramatici contextuale cu selectiva regulata. Stud. Cerc. Mat. 30, pp. 287–294.
16. Florin Manea & Bianca Truthe (2012): On Internal Contextual Grammars with Subregular Selection Languages. In: Martin Kutrib, Nelma Moreira & Rogério Reis: Descriptional Complexity of Formal Systems – 14th International Workshop, DCFS 2012, Braga, Portugal, July 23\,–\,25, 2012. Proceedings, LNCS 7386. Springer-Verlag, pp. 222–235, doi:10.1007/978-3-642-31623-4_17.
17. Solomon Marcus (1969): Contextual grammars. Revue Roum. Math. Pures Appl. 14, pp. 1525–1534.
18. Robert McNaughton & Seymour Papert (1971): Counter-free Automata. MIT Press, Cambridge, USA.
19. M. Perles, M. M. Rabin & E. Shamir (1963): The theory of definite automata. IEEE Trans. Electronic Computers 12, pp. 233–243, doi:10.1109/PGEC.1963.263534.
20. Gheorghe Păun (1998): Marcus Contextual Grammars. Kluwer Publ. House, Doordrecht, doi:10.1007/978-94-015-8969-7.
21. Stefano Crespi Reghizzi & Pierluigi San Pietro (2011): From Regular to Strictly Locally Testable Languages. In: P. Ambrož, Š. Holub & Z. Masáková: 8th International Conference WORDS 2011, EPTCS 63, pp. 103–111, doi:10.4204/EPTCS.63.14.
22. Grzegorz Rozenberg & Arto Salomaa (1997): Handbook of Formal Languages. Springer-Verlag, Berlin, doi:10.1007/978-3-642-59136-5.
23. H. J. Shyr (1991): Free Monoids and Languages. Hon Min Book Co., Taichung, Taiwan.
24. H. J. Shyr & G. Thierrin (1974): Ordered Automata and Associated Languages. Tankang Journal of Mathematics 5(1), pp. 9–20.
25. H. J. Shyr & G. Thierrin (1974): Power-Separating Regular Languages. Mathematical Systems Theory 8(1), pp. 90–95, doi:10.1007/BF01761710.
26. Bianca Truthe (2014): A Relation Between Definite and Ordered Finite Automata. In: Suna Bensch, Rudolf Freund & Friedrich Otto: Sixth Workshop on Non-Classical Models of Automata and Applications (NCMA), Kassel, Germany, July 28–29, 2014, Proceedings, books@ocg.at 304. Österreichische Computer Gesellschaft, pp. 235–247.
27. Bianca Truthe (2018): Hierarchy of Subregular Language Families. Technical Report. Justus-Liebig-Universität Giessen, Institut für Informatik, IFIG Research Report 1801.
28. Bianca Truthe (2021): Generative Capacity of Contextual Grammars with Subregular Selection Languages. Fundamenta Informaticae 180, pp. 1–28, doi:10.3233/FI-2021-2037.
29. Barbara Wiedemann (1978): Vergleich der Leistungsfähigkeit endlicher determinierter Automaten. Diplom\-arbeit. Universität Rostock.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org