Quotient automaton

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution…

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…