نتایج جستجو برای: trim reversal general fuzzy automata

تعداد نتایج: 858040  

2010
S. Gnanasekaran

Berstel and Pin have characterized local languages by introducing local automaton. In this paper fuzzy local language is introduced and the fuzzy local languages recognized by partial fuzzy local automata in max-min and min-max compositions are studied. Some closure properties of fuzzy local languages are provided. Mathematics Subject Classification: 68Q45

Journal: :Int. J. Found. Comput. Sci. 2006
M. V. Panduranga Rao

We generalize the definition of a counter and counter reversal complexity and investigate the power of generalized deterministic counter automata in terms of language recognition.

2012
Harry G Kwatny Robert C. Allen

The flight envelope can be viewed as a set within the state space of an aircraft. For various safety considerations an aircraft is required to remain within its prescribed flight envelope. The safe set is the largest controlled invariant set within the flight envelope. Thus, if an aircraft is to remain within its envelope it must stay within the safe set. When an aircraft is impaired, e.g., a j...

2000
Zhe Dang Oscar H. Ibarra Tevfik Bultan Richard A. Kemmerer Jianwen Su

We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automaton includes a control state, nitely many clock values and a stack word. Using a pure automata-theoretic approach, we show that the binary reachability (i.e., the set of all pairs of con gurations ( ; ), encoded as st...

Journal: :IJNCR 2010
Mika Hirvensalo

A model for finite automaton with an open quantum evolution is introduced, and its basic properties are studied. It is shown that the (fuzzy) languages accepted by open evolution quantum automata obey various closure properties. More importantly, it is shown that major other models of finite automata, including probabilistic, measure once quantum, measure many quantum, and Latvian quantum autom...

Journal: :International Journal of Approximate Reasoning 2008

Journal: :Trends in Applied Sciences Research 2012

Journal: :Information and Control 1985
Christoph Haase Piotr Hofman

Given two finite-state automata, are the Parikh images of the languages they generate equivalent? This problem was shown decidable in coNEXP by Huynh in 1985 within the more general setting of context-free commutative grammars. Huynh conjectured that a Π2 upper bound might be possible, and Kopczyński and To established in 2010 such an upper bound when the size of the alphabet is fixed. The cont...

Journal: :Occupational medicine 2015
D Whybrow N Jones N Greenberg

BACKGROUND Trauma Risk Management (TRiM) is a peer support system developed within the British Armed Forces. It aims to ensure that trauma-exposed personnel are properly supported and encouraged to seek timely help should they develop mental health problems that fail to resolve spontaneously. AIMS To summarize current knowledge about TRiM and make recommendations for further research. METHO...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید