Zobrazeno 1 - 10
of 119
pro vyhledávání: '"Nelma Moreira"'
Autor:
Marcus V M Ramos, José Carlos Bacelar Almeida, Nelma Moreira, Ruy José Guerra Barretto de Queiroz
Publikováno v:
Journal of Formalized Reasoning, Vol 9, Iss 2, Pp 53-68 (2016)
Context-free languages are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma is a property that is valid for all context-free languages, and is used to show the existence of non contex
Externí odkaz:
https://doaj.org/article/9395e1fc070943e49210cd2d5c4bc395
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 96, Iss Proc. GandALF 2012, Pp 127-140 (2012)
Kleene algebra with tests (KAT) is an equational system for program verification, which is the combination of Boolean algebra (BA) and Kleene algebra (KA), the algebra of regular expressions. In particular, KAT subsumes the propositional fragment of
Externí odkaz:
https://doaj.org/article/dc3767446a714ae897f5ebea471f01df
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 31, Iss Proc. DCFS 2010, Pp 139-148 (2010)
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to regular expressions have an exponential blow-up in the worst-case. To
Externí odkaz:
https://doaj.org/article/55bf2f80f8154ca59ddd60513769fa45
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 3, Iss Proc. DCFS 2009, Pp 47-57 (2009)
The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al. presented an improved variant. H
Externí odkaz:
https://doaj.org/article/78d85b06897e4581b6ceab0c4d796d7b
Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) — Preface
Autor:
Nelma Moreira, Rogéxrio Reis
Publikováno v:
International Journal of Foundations of Computer Science. 34:81-83
Publikováno v:
Acta Informatica. 58:357-375
Partial derivatives are widely used to convert regular expressions to nondeterministic automata. For the word membership problem, it is not strictly necessary to build an automaton. In this paper, we study the size of partial derivatives on the avera
Publikováno v:
Theoretical Computer Science. 956:113830
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 132:100847
Publikováno v:
Theoretical Computer Science. 870:103-120
Autor:
Nelma Moreira, Rogério Reis
Publikováno v:
Implementation and Application of Automata ISBN: 9783031074684
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::41af5126a34272c65d27206a8d99e70c
https://doi.org/10.1007/978-3-031-07469-1_2
https://doi.org/10.1007/978-3-031-07469-1_2