Skip to search formSkip to main contentSkip to account menu

Quotient automaton

In computer science, in particular in formal language theory, a quotient automaton can be obtained from a given nondeterministic finite automaton by… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
est generation has been acknowledged as a cost-prone activity reducing productivity and time to market. Theexpected benefits of… 
Review
2014
Review
2014
In this paper we consider the computation of indistinguishable state pairs of nondeterministic finite automata where some… 
2014
2014
We study the complexity of basic regular operations on languages represented by incomplete deter-ministic or nondeterministic… 
2014
2014
This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution… 
2013
2013
We present a formal constructive theory of regular languages consisting of about 1400 lines of Coq/Ssreflect. As representations… 
2005
2005
ZusammenfassungJeder UntergruppeH der Automorphismengruppe eines Automaten kann der Quotientenautomat nachH zugeordnet werden… 
1998
1998
In this paper we investigate a method to exploit the symmetry inherent to many systems in order to reduce the computational… 
1997
1997
At first, we define the concept of quantified abstract quotient automaton (which concerns state graphs with qualitative and… 
1994
1994
In [2], we proposed a verification by abstraction approach for protocol specifications written in Estelle*, an enhanced Estelle…