The article describes a compact formalization of the relation between regular expressions and deterministic finite automata, and a formally verified, efficient algorithm for testing regular expression equivalence, both based on the original notion of pointed regular expression
International audienceWe investigate the complexity of deciding whether a given regular language can...
International audienceWe investigate the complexity of deciding whether a given regular language can...
International audienceWe investigate the complexity of deciding whether a given regular language can...
The article describes a compact formalization of the relation between regular expressions and determ...
The article describes a compact formalization of the relation between regular expressions and determ...
The minimal deterministic finite automaton is generally used to determine regular languages equalit...
Abstract. An original algorithm for transformation of finite automata to regular expressions is pres...
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene...
Abstract. We solve an open question of Milner [1984]. We define a set of so-called well-behaved fini...
Abstract. We solve an open question of Milner [1984]. We define a set of so-called well-behaved fini...
AbstractThe main theorem allows an elegant algorithm to be refined into an efficient one. The elegan...
Abstract. We investigate the complexity of deciding whether a given regular language can be defined ...
We formalize a unified framework for verified decision procedures for regular expression equivalence...
We present a proof of correctness of an algorithm for directly constructing a deterministic finite a...
International audienceWe investigate the complexity of deciding whether a given regular language can...
International audienceWe investigate the complexity of deciding whether a given regular language can...
International audienceWe investigate the complexity of deciding whether a given regular language can...
International audienceWe investigate the complexity of deciding whether a given regular language can...
The article describes a compact formalization of the relation between regular expressions and determ...
The article describes a compact formalization of the relation between regular expressions and determ...
The minimal deterministic finite automaton is generally used to determine regular languages equalit...
Abstract. An original algorithm for transformation of finite automata to regular expressions is pres...
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene...
Abstract. We solve an open question of Milner [1984]. We define a set of so-called well-behaved fini...
Abstract. We solve an open question of Milner [1984]. We define a set of so-called well-behaved fini...
AbstractThe main theorem allows an elegant algorithm to be refined into an efficient one. The elegan...
Abstract. We investigate the complexity of deciding whether a given regular language can be defined ...
We formalize a unified framework for verified decision procedures for regular expression equivalence...
We present a proof of correctness of an algorithm for directly constructing a deterministic finite a...
International audienceWe investigate the complexity of deciding whether a given regular language can...
International audienceWe investigate the complexity of deciding whether a given regular language can...
International audienceWe investigate the complexity of deciding whether a given regular language can...
International audienceWe investigate the complexity of deciding whether a given regular language can...
DOI
Add to ORKG