Closure Properties of Intuitionistic Fuzzy Finite Automata with Unique Membership Transitions on an Input Symbol

2014 ◽  
Author(s):  
Jency Priya K ◽  
Jeny Jordon A ◽  
Telesphor Lakra ◽  
Rajaretnam T.
Keyword(s):  
Finite Automata ◽  
Input Symbol ◽  
Closure Properties ◽  
Intuitionistic Fuzzy ◽  
Fuzzy Finite Automata

Recognizability of Intuitionistic Fuzzy Finite Automata-Homomorphic Images

2014 ◽  
Author(s):  
A. Jeny Jordon ◽  
Telesphor Lakra ◽  
K. Jency Priya ◽  
T. Rajaretnam
Keyword(s):  
Finite Automata ◽  
Intuitionistic Fuzzy ◽  
Fuzzy Finite Automata

Intuitionistic Fuzzy Finite Automata with Unique Membership Transitions

2014 ◽  
Author(s):  
Telesphor Lakra ◽  
A. Jeny Jordon ◽  
K. Jency Priya ◽  
T. Rajaretnam
Keyword(s):  
Finite Automata ◽  
Intuitionistic Fuzzy ◽  
Fuzzy Finite Automata

Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change

2018 ◽  
Vol 29 (02) ◽  
pp. 213-231
Author(s):  
Christopher Czyba ◽  
Wolfgang Thomas ◽  
Christopher Spinrath
Keyword(s):  
Finite Automata ◽  
Local Change ◽  
Closure Properties ◽  
Open Issues

Two models of automata over infinite alphabets are presented, mainly with a focus on the alphabet [Formula: see text]. In the first model, transitions can refer to logic formulas that connect properties of successive letters. In the second, the letters are considered as columns of a labeled grid which an automaton traverses column by column. Thus, both models focus on the comparison of successive letters, i.e. “local changes”. We prove closure (and non-closure) properties, show the decidability of the respective non-emptiness problems, prove limits on decidability results for extended models, and discuss open issues in the development of a generalized theory.

Preface

1997 ◽  
Vol 11 (07) ◽  
pp. 1023-1024
Author(s):  
Serge Miguet ◽  
Annick Montanvert ◽  
P. S. P. Wang
Keyword(s):  
Finite State Machine ◽  
Finite Automata ◽  
Upper Bounds ◽  
Two Dimensional ◽  
Turing Machines ◽  
Closure Properties ◽  
Working Space ◽  
Finite State ◽  
The Individual ◽  
Alternating Turing Machines

Several nonclosure properties of each class of sets accepted by two-dimensional alternating one-marker automata, alternating one-marker automata with only universal states, nondeterministic one-marker automata, deterministic one-marker automata, alternating finite automata, and alternating finite automata with only universal states are shown. To do this, we first establish the upper bounds of the working space used by "three-way" alternating Turing machines with only universal states to simulate those "four-way" non-storage machines. These bounds provide us a simplified and unified proof method for the whole variants of one-marker and/or alternating finite state machine, without directly analyzing the complex behavior of the individual four-way machine on two-dimensional rectangular input tapes. We also summarize the known closure properties including Boolean closures for all the variants of two-dimensional alternating one-marker automata.

Sign in / Sign up

Export Citation Format

Share Document