I/O automata based verification of finite state distributed systems: complexity issues
Abstract
References
Index Terms
- I/O automata based verification of finite state distributed systems: complexity issues
Recommendations
On the power of quantum finite state automata
FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer ScienceIn this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts ...
The parallel complexity of finite-state automata problems
The goal of this paper is to study the exact complexity of several important problems concerning finite-state automata and to classify the degrees of ambiguity of nondeterministic finite-state automata. Our results are as follows: (1) Minimization of ...
Residual Finite State Automata
STACS '01: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer ScienceWe introduce a subclass of non deterministic finite automata (NFA) that we call Residual Finite State Automata (RFSA): a RFSA is a NFA all the states of which define residual languages of the language it recognizes. We prove that for every regular ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 182Total Downloads
- Downloads (Last 12 months)22
- Downloads (Last 6 weeks)3
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in