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)

Related topics

Related topics

9 relations
Computer scienceFinite-state machineFormal languageInduction of regular languages

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Test Sequence Generation From Formally Verified SysML Models
est generation has been acknowledged as a cost-prone activity reducing productivity and time to market. Theexpected benefits of… 
2014
2014
Operations on Automata with All States Final
We study the complexity of basic regular operations on languages represented by incomplete deter-ministic or nondeterministic… 
Review
2014
Review
2014
On computing indistinguishable states of nondeterministic finite automata with partially observable transitions
In this paper we consider the computation of indistinguishable state pairs of nondeterministic finite automata where some… 
2014
2014
Intuitionistic fuzzy automaton and the minimal machine
This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution… 
Review
2007
Review
2007
Minimization of Lattice Automata
Theories of minimization of fuzzy automata have been developed by several authors, and most of which applied methods of algebraic… 
2002
2002
On quotient machines of a fuzzy automaton and the minimal machine
1998
1998
Exploiting symmetry in the synthesis of supervisors for discrete event systems
In this paper we investigate a method to exploit the symmetry inherent to many systems in order to reduce the computational… 
1997
1997
Concept of Quantified Abstract Quotient Automaton and its Advantage
At first, we define the concept of quantified abstract quotient automaton (which concerns state graphs with qualitative and… 
1995
1995
Verification by abstraction as a preamble for interoperability test suite generation
In [2], we proposed a verification by abstraction approach for protocol specifications written in Estelle*, an enhanced Estelle… 
1968
1968
Der Quotientenautomat nach einem direkten Faktor einer Automorphismengruppe
ZusammenfassungJeder UntergruppeH der Automorphismengruppe eines Automaten kann der Quotientenautomat nachH zugeordnet werden… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)