H. Yamamoto. An automata-based recognition algorithm for semi-extended regular expressions. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science, pages 699--708, 2000. 20  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Improved Algorithm for the Membership Problem for.. - Kupferman, Zuhovitzky (2002) (4 citations) (Correct)
....in the literature [Hro86, Slo88, DHK 89, Yam00b] Essentially, in synchronous alternating automata, some of the states are designated as synchronization states, and the spawned copies of the automaton have to agree on positions in the input word in which they visit synchronization states. In [Yam00a] Yamamoto introduces partially inputsynchronized alternating automata, and shows an algorithm for membership in SEREs that is based on a translation of SEREs into the new model. While the new algorithm improves the known algorithms it runs in time O(m n ) where k is the number of ....
.... m over , we build an ASUN A r over with O(m) states such that L(r) L(A r ) The construction is similar to the one used for translating regular expression into nondeterministic automata with transitions [HMU00] The treatment of conjunctions is similar to the one described by Yamamoto in [Yam00a] adjusted to our simpler type of automata. The treatment of negations is by negation states. Theorem 3.1 Given an ERE r of length m, we can construct an ASUN A r of size O(m) such that L(r) L(A r ) Furthermore, A r has the following properties: 1. A r has exactly one accepting state, and ....
H. Yamamoto. An automata-based recognition algorithm for semi-extended regular expressions. In Proc. 25th International Symp. on Mathematical Foundations of Computer Science, volume 1893 of Lecture Notes in Computer Science, pages 699--708. Springer-Verlag, 2000.
Generating Optimal Monitors for Extended Regular Expressions - Sen, Rosu (2003) (Correct)
No context found.
H. Yamamoto. An automata-based recognition algorithm for semi-extended regular expressions. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science, pages 699--708, 2000. 20
Testing Extended Regular Language Membership Incrementally.. - Rosu, Viswanathan (2003) (Correct)
No context found.
H. Yamamoto. An automata-based recognition algorithm for semi-extended regular expressions. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science, pages 699--708, 2000.
Rewriting-based Techniques for Runtime Verification - Rosu, Havelund (1 citation) (Correct)
No context found.
H. Yamamoto. An Automata-based Recognition Algorithm for Semi-Extended Regular Expressions. In Proc. of the International Symposium on Mathematical Foundations of Computer Science, volume 1893 of Lecture Notes in Computer Science, pages 699--708, 2000. 44
Rewriting-based Techniques for Runtime Verification - Rosu, Havelund (1 citation) (Correct)
No context found.
H. Yamamoto. An Automata-based Recognition Algorithm for Semi-Extended Regular Expressions. In Proc. of the International Symposium on Mathematical Foundations of Computer Science, volume 1893 of Lecture Notes in Computer Science, pages 699--708, 2000. 44
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC