EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 57 (2023) RAIRO-Theor. Inf. Appl., 57 (2023) 10 References
Issue
RAIRO-Theor. Inf. Appl.
Volume 57, 2023
12th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2022)
Article Number 10
Number of page(s) 21
DOI https://doi.org/10.1051/ita/2023012
Published online 13 November 2023
  1. J.A. Brzozowski, Regular Expression Techniques for Sequential Circuits. PhD thesis, Princeton University, Princeton, NJ, USA, 1962. [Google Scholar]
  2. J.A. Brzozowski, G. Jirásková and C. Zou, Quotient complexity of closed languages. Theory Comput. Syst. 54 (2014) 277–292. [CrossRef] [MathSciNet] [Google Scholar]
  3. J. Dassow, Contextual grammars with subregular choice. Fundam. Inform. 64 (2005) 109–118. [Google Scholar]
  4. J. Dassow, Contextual languages with strictly locally testable and star free selection languages. Anal. Univ. Bucureşti 62 (2015) 25–36. [Google Scholar]
  5. J. Dassow, Grammars with control by ideals and codes. J. Automata Lang. Combinatorics 23 (2018) 143–164. [MathSciNet] [Google Scholar]
  6. J. Dassow, Remarks on external contextual grammars with selection. Theor. Comput. Sci. 862 (2021) 119–129. [CrossRef] [Google Scholar]
  7. J. Dassow, F. Manea and B. Truthe, On external contextual grammars with subregular selection languages. Theor. Comput. Sci. 449 (2012) 64–73. [CrossRef] [Google Scholar]
  8. J. Dassow, F. Manea and B. Truthe, On subregular selection languages in internal contextual grammars. J. Automata Lang. Combinatorics 17 (2012) 145–164. [MathSciNet] [Google Scholar]
  9. J. Dassow and B. Truthe, On the generative capacity of contextual grammars with strictly locally testable selection languages, in 12th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2022), Debrecen, Hungary, August 26-27, 2022. Proceedings, edited by H. Bordihn, G. Horváth and G. Vaszil. Vol. 367 of EPTCS. Open Publishing Association (2022) 65–80. [Google Scholar]
  10. P. Garcia, E. Vidal and J. Oncina, Learning locally testable languages in the strict sense, in Proc. Algorithmic Learning Theory 1990, edited by S. Arikawa, S. Goto, S. Ohsuga and T. Yokomori. Springer/Ohmsha (1990) 325–338. [Google Scholar]
  11. F. Gécseg and I. Peak, Algebraic Theory of Automata. Academiai Kiado, Budapest (1972). [Google Scholar]
  12. A. Gill and L.T. Kou, Multiple-entry finite automata. J. Comput. Syst. Sci. 9 (1974) 1–19. [CrossRef] [Google Scholar]
  13. I.M. Havel, The theory of regular events II. Kybernetika 5 (1969) 520–544. [MathSciNet] [Google Scholar]
  14. M. Holzer and B. Truthe, On relations between some subregular language families, in Seventh Workshop on Non-Classical Models of Automata and Applications (NCMA), Porto, Portugal, August 31-September 1, 2015, Proceedings, edited by R. Freund, M. Holzer, N. Moreira and R. Reis. Vol. 318 of books@ocg.at. (Österreichische Computer Gesellschaft (2015) 109–124. [Google Scholar]
  15. S. Istrail, Gramatici contextuale cu selectiva regulata. Stud. Cerc. Mat. 30 (1978) 287–294. [MathSciNet] [Google Scholar]
  16. M. Kudlek, On languages of cyclic words, in Proc. Aspects of Molecular Computing, edited by N. Jonoska, G. Paun and G. Rozenberg. Vol. 2950 of LNCS. Springer-Verlag (2004) 278–288. [CrossRef] [Google Scholar]
  17. S. Marcus, Contextual grammars. Rev. Roum. Math. Pures Appl. 14 (1969) 1525–1534. [Google Scholar]
  18. R. McNaughton and S. Papert, Counter-free Automata. MIT Press, Cambridge, USA (1971). [Google Scholar]
  19. G. Păun, Marcus Contextual Grammars. Kluwer Publ. House, Doordrecht (1998). [Google Scholar]
  20. M. Perles, M.M. Rabin and E. Shamir, The theory of definite automata. IEEE Trans. Electron. Comput. 12 (1963) 233–243. [CrossRef] [Google Scholar]
  21. S.C. Reghizzi and P. San Pietro, From regular to strictly locally testable languages, in 8th International Conference WORDS 2011. Vol. 63 of EPTCS, edited by P. Ambrož, Š. Holub and Z. Masáková (2011) 103–111. [Google Scholar]
  22. G. Rozenberg and A. Salomaa, editors. Handbook of Formal Languages. Springer-Verlag, Berlin (1997). [Google Scholar]
  23. H.J. Shyr, Free Monoids and Languages. Hon Min Book Co., Taichung, Taiwan (1991). [Google Scholar]
  24. H.J. Shyr and G. Thierrin, Ordered automata and associated languages. Tankang J. Math. 5 (1974) 9–20. [Google Scholar]
  25. H.J. Shyr and G. Thierrin, Power-separating regular languages. Math. Syst. Theory 8 (1974) 90–95. [CrossRef] [Google Scholar]
  26. B. Truthe, A Relation Between Definite and Ordered Finite Automata, in Sixth Workshop on Non-Classical Models of Automata and Applications (NCMA), Kassel, Germany, July 28-29, 2014, Proceedings, edited by S. Bensch, R. Freund and F. Otto. Vol. 304 of books@ocg.at. (Österreichische Computer Gesellschaft (2014) 235–247. [Google Scholar]
  27. B. Truthe, Hierarchy of subregular language families. Technical report, Justus-Liebig-Universität Giessen, Institut für Informatik, IFIG Research Report 1801 (2018). [Google Scholar]
  28. B. Truthe, Generative capacity of contextual grammars with subregular selection languages. Fundam. Inform. 180 (2021) 1–28. [Google Scholar]
  29. B. Wiedemann. Vergleich der Leistungsfahigkeit endlicher determinierter Automaten. Diplomarbeit, Universitat Rostock, 1978. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.