Quotient automaton

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

Topic mentions per year

Topic mentions per year

1968-2014
01219682014

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution… (More)
Is this relevant?
2014
2014
A language L is prefix-closed if w ∈ L implies that every prefix of w is in L. It is known that a regular language is prefix… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
action t tti r t tti r t tti r think1 t i t i t i tau ta ta ta eat1 t ea t eat ea ~tau ta ta ta think2 t i t i t i tau ta ta ta… (More)
  • figure 1
Is this relevant?
2005
2005
ion methods An approach that has proven significant in analyzing complicated systems is to collapse large systems into smaller… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1968
1968
Jeder UntergruppeH der Automorphismengruppe eines Automaten kann der Quotientenautomat nachH zugeordnet werden, wenn man die… (More)
Is this relevant?