Open Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 58, 2024
12th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2022)
|
|
|---|---|---|
| Article Number | 6 | |
| Number of page(s) | 31 | |
| DOI | https://doi.org/10.1051/ita/2023014 | |
| Published online | 15 March 2024 | |
- S. Kleene, Representation of events in nerve nets and finite automata. Automata studies. Ann. Math. Stud. 34 (1956) 3–41. [Google Scholar]
- M.P. Schützenberger, On the definition of a family of automata. Inf. Control. 4 (1961) 245–270. [CrossRef] [Google Scholar]
- G. Berry and R. Sethi, From regular expressions to deterministic automata. Theoret. Comput. Sci. 48 (1986) 117–126. [CrossRef] [MathSciNet] [Google Scholar]
- P. Caron and M. Flouret, From glushkov wfas to k-expressions. Fundam. Informaticae 109 (2011) 1–25. [CrossRef] [Google Scholar]
- J.-M. Champarnaud, É. Laugerotte, F. Ouardi and D. Ziadi, From regular weighted expressions to finite automata. Int. J. Found. Comput. Sci. 15 (2004) 687–700. [CrossRef] [Google Scholar]
- J.A. Brzozowski, Derivatives of regular expressions. J. ACM 11 (1964) 481–494. [Google Scholar]
- V.M. Antimirov, Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155 (1996) 291–319. [CrossRef] [Google Scholar]
- S. Lombardy and J. Sakarovitch, Derivatives of rational expressions with multiplicity. Theor. Comput. Sci. 332 (2005) 141–177. [CrossRef] [Google Scholar]
- M. Sulzmann and K. Zhuo Ming Lu, POSIX regular expression parsing with derivatives, in FLOPS. Vol. 8475 of Lecture Notes in Computer Science. Springer (2014) 203–220. [CrossRef] [Google Scholar]
- S. Attou, L. Mignot, C. Miklarz and F. Nicart, Monadic expressions and their derivatives, in NCMA. Vol. 367 of EPTCS (2022) 49–64. [CrossRef] [Google Scholar]
- T. Colcombet and D. Petrisan, Automata and minimization. SIGLOG News 4 (2017) 4–27. [CrossRef] [Google Scholar]
- L. Mignot, Une proposition d’implantation des structures d’automates, d’expressions et de leurs algorithmes associes utilisant les catégories enrichies (in French). Habilitation à diriger des recherches, Université de Rouen normandie, Décembre 2020. 212 pages. [Google Scholar]
- M.P. Jones, Functional programming with overloading and higher-order Polymorphism, in Adv. Func. Prog.. Vol. 925 of LNCS. Springer (1995) 97–136. [Google Scholar]
- S. Mac Lane, Categories for the Working Mathematician, Vol. 5. Springer Science & Business Media (2013). [Google Scholar]
- J.-L. Loday and B. Vallette, Algebraic Operads, Vol. 346. Springer Science & Business Media (2012). [Google Scholar]
- J.P. May, The Geometry of Iterated Loop Spaces. Vol. 271 of Lecture Notes in Mathematics. Springer, Berlin, New York (1972). [CrossRef] [Google Scholar]
- H. Kleisli, Every standard construction is induced by a pair of adjoint functors. Proc. Am. Math. Soc. 16 (1956) 544–546. [Google Scholar]
- R.A. Eisenberg and S. Weirich, Dependently typed programming with singletons, in Haskell. ACM (2012) 117–130. [Google Scholar]
- L. Mignot, Monadic derivatives. https://github.com/LudovicMignot/MonadicDerivatives, 2022. [Google Scholar]
- IEEE Std 1003.1 — posix regular expressions. https://pubs.opengroup.org/onlinepubs/9699919799/basedefs/VUchap09.html. [Google Scholar]
- Pcre — perl compatible regular expressions. https://www.pcre.org. [Google Scholar]
- B. Klin and J. Salamanca, Iterated covariant powerset is not a monad. Electr. Notes Theor. Comput. Sci. 341 (2018) 261–276. [CrossRef] [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.