Extended Simulation Function via Rational Expressions
نویسندگان
چکیده
منابع مشابه
Derived-Term Automata for Extended Weighted Rational Expressions (Long version)
We present an algorithm to build an automaton from a rational expression. This approach introduces support for extended weighted expressions. Inspired by derived-term based algorithms, its core relies on a different construct, rational expansions. We introduce an inductive algorithm to compute the expansion of an expression from which the automaton follows. This algorithm is independent of the ...
متن کاملDerived-Term Automata for Extended Weighted Rational Expressions
We present an algorithm to build an automaton from a rational expression. This approach introduces support for extended weighted expressions. Inspired by derived-term based algorithms, its core relies on a different construct, rational expansions. We introduce an inductive algorithm to compute the expansion of an expression from which the automaton follows. This algorithm is independent of the ...
متن کاملStar-connected rational expressions
Star-connected rational expressions were considered only as expressions defining trace languages. In this paper we continue the study of the class of flat languages defined by this kind of rational expressions (see [5], [4]). We obtain stronger results and prove that any language is star-connected iff it is accepted by a finite automaton with cycles which are proper composition of connected cyc...
متن کاملAutomata and rational expressions
This text is an extended version of the chapter ‘Automata and rational expressions’ in the AutoMathA Handbook [47] that will appear soon, published by the European Science Foundation and edited by Jean-Éric Pin. It contains not only proofs, examples, and remarks that had been discarded due to the severe space constraints induced by the edition of a handbook of very large scope, but also develop...
متن کاملOn Extended Regular Expressions
In this paper we extend the work of Campeanu, Salomaa and Yu [1] on extended regular expressions featured in the Unix utility egrep and the popular scripting language Perl. We settle the open issue of closure under intersection and provide an improved pumping lemma that will show that a larger class of languages is not recognizable by extended regular expressions. We also investigate some quest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8050710