Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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… Expand

Is this relevant?

Review

2014

Review

2014

In this paper we consider the computation of indistinguishable state pairs of nondeterministic finite automata where some… Expand

Is this relevant?

2013

2013

We present a formal constructive theory of regular languages consisting of about 1400 lines of Coq/Ssreflect. As representations… Expand

Is this relevant?

Review

2007

Review

2007

Theories of minimization of fuzzy automata have been developed by several authors, and most of which applied methods of algebraic… Expand

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… Expand

Is this relevant?

2005

2005

ZusammenfassungJeder UntergruppeH der Automorphismengruppe eines Automaten kann der Quotientenautomat nachH zugeordnet werden… Expand

Is this relevant?

2002

2002

In this paper the concept of substitution property (SP) partition for a finite fuzzy automaton is formulated, and the quotient… Expand

Is this relevant?

1998

1998

In this paper we investigate a method to exploit the symmetry inherent to many systems in order to reduce the computational… Expand

Is this relevant?

1997

1997

At first, we define the concept of quantified abstract quotient automaton (which concerns state graphs with qualitative and… Expand

Is this relevant?

1994

1994

In [2], we proposed a verification by abstraction approach for protocol specifications written in Estelle*, an enhanced Estelle… Expand

Is this relevant?