Büchi Automata Can Have Smaller Quotients-Reference-Cited by-同舟云学术

Büchi Automata Can Have Smaller Quotients

Published:2011 Issue: Volume: Page:258-270
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Clemente Lorenzo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22012-8_20

Reference22 articles.

1. Abdulla, P., Chen, Y.-F., Holik, L., Vojnar, T.: Mediating for Reduction. In: FSTTCS, pp. 1–12. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2009)

2. Aziz, A., Singhal, V., Swamy, G.M., Brayton, R.K.: Minimizing Interacting Finite State Machines. Technical Report UCB/ERL M93/68, UoC, Berkeley (1993)

3. Clemente, L.: Büchi Automata can have Smaller Quotients. Technical Report EDI-INF-RR-1399, LFCS, University of Edinburgh (April 2011)

4. Lecture Notes in Computer Science;L. Clemente,2010

5. Lecture Notes in Computer Science;D.L. Dill,1992

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Simulation Relations and Applications in Formal Methods;Lecture Notes in Computer Science;2022

2. Approximate reduction of finite automata for high-speed network intrusion detection;International Journal on Software Tools for Technology Transfer;2019-05-24

3. EFFICIENT REDUCTION OF NONDETERMINISTIC AUTOMATA WITH APPLICATION TO LANGUAGE INCLUSION TESTING;LOG METH COMPUT SCI;2019

4. Simulations in Rank-Based Büchi Automata Complementation;Programming Languages and Systems;2019

5. Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection;Tools and Algorithms for the Construction and Analysis of Systems;2018