Filters








1,770 Hits in 3.2 sec

Inference of Finite Automata Using Homing Sequences

R.L. Rivest, R.E. Schapire
1993 Information and Computation  
A key technique used is inference of a homing sequence for the unknown automaton.  ...  We present an analogous algorithm which makes use of a diversitybased representation of the finite-state system.  ...  Our algorithms use powerful new techniques based on the inference of homing sequences.  ... 
doi:10.1006/inco.1993.1021 fatcat:drgkxv3gdrdmrlbvgpxczfgvfu

Page 2372 of Mathematical Reviews Vol. , Issue 95d [page]

1995 Mathematical Reviews  
Schein (1-AR; Fayetteville, AR) 95d:68100 68Q70 Rivest, Ronald L. (1-MIT-LC; Cambridge, MA); Schapire, Robert E. (1-MIT-LC; Cambridge, MA) Inference of finite automata using homing sequences.  ...  It should be pointed out that these algorithms for inferring an unknown finite automaton are related to certain algorithms for inferring an automaton described in the monograph of B. A.  ... 

Using Adaptive Sequences for Learning Non-Resettable FSMs

Roland Groz, Nicolas Brémond, Adenilso Simão
2018 International Conference on Grammatical Inference  
This paper proposes a new method to infer non-resettable Mealy machines based on the notions of adaptive homing and characterizing used in FSM testing.  ...  It is fast, and scales to machines that have hundreds of states. It outperforms in most respect previous algorithms, and can even compete with algorithms that assume a reset.  ...  The basic idea is to use a homing sequence as a substitute for a reset, and for each outcome of the reset sequence, using a distinct copy of L * .  ... 
dblp:conf/icgi/GrozBS18 fatcat:k5s7w5hkcrbnhm6lrpdiudplpi

The design and analysis of efficient learning algorithms

1994 Discrete Applied Mathematics  
A typology of mixed-motive games. Replicators, hypercycles and selection. Equilibrium properties of replicator systems. Perseverance of species in replicator systems.  ...  Reachability of bilinear systems,  ...  Chapter 5: Inference of Finite Automata Using Homing Sequences. Introduction. Two representations of finite automata. Homing sequences. A state-based algorithm for general automata.  ... 
doi:10.1016/0166-218x(94)90159-7 fatcat:2bmebkuqn5as3gt64x6bjm4xb4

Reality rules: 2 picturing the world in mathematics. The frontier

1994 Discrete Applied Mathematics  
A typology of mixed-motive games. Replicators, hypercycles and selection. Equilibrium properties of replicator systems. Perseverance of species in replicator systems.  ...  Reachability of bilinear systems,  ...  Chapter 5: Inference of Finite Automata Using Homing Sequences. Introduction. Two representations of finite automata. Homing sequences. A state-based algorithm for general automata.  ... 
doi:10.1016/0166-218x(94)90158-9 fatcat:aexajvcevvdrrhrtm36rq3dqu4

Automatic Construction of Finite Automata for Online Recognition of User Activities in Smart Environments

H. Karamath Ali
2013 IOSR Journal of Engineering  
Because of their ability to classify given inputs in a simple and efficient manner, Finite State Machine(FSM)s have good potential to be used for recognizing user activities.  ...  In this paper, we propose a method for automatic construction of an FSM that can be used to recognize user activities in real time.  ...  Therefore in each state of the SL-infer algorithm, the corresponding activity (or activities) of the code sequence in which " " appears is stored.  ... 
doi:10.9790/3021-031234045 fatcat:ktiyia4ifvcsrceb4u4gl6dph4

Active Automata Learning in Practice [chapter]

Falk Howar, Bernhard Steffen
2018 Lecture Notes in Computer Science  
Five years ago (in 2011) we have surveyed the then current state of active automata learning research and applications of active automata learning in practice.  ...  Active automata learning is slowly becoming a standard tool in the toolbox of the software engineer.  ...  Solutions range here from reset mechanisms via homing sequences [130] or snapshots of the system state to the generation of observably equivalent initial conditions.  ... 
doi:10.1007/978-3-319-96562-8_5 fatcat:jtpzftrzvzf3tdtbncntfc4s4q

Activity Recognition with Multi-tapeFuzzy Finite Automata

H. Karamath Ali, D. I. George Amalarethinam
2013 International Journal of Modern Education and Computer Science  
This paper explains how multitape fuzzy finite state automata can be used to effectively recognize human activities.  ...  The method explained is found to give good results when tested using publicly available activity datasets collected in a smart home environment.  ...  The -infer algorithms suggested by Henning Fernau [21] are used by us for the automatic construction of a finite automaton.  ... 
doi:10.5815/ijmecs.2013.05.07 fatcat:poywjp6fmbh3nohiwsgdt3imua

Efficient Learning of Typical Finite Automata from Random Walks

Yoav Freund, Michael Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie
1997 Information and Computation  
This paper describes new and efficient algorithms for learning deterministic finite automata.  ...  behavior on a random input sequence.  ...  In a related setting, Rivest and Schapire [20] introduced the idea of using a homing sequence for learning finite automata in the absence of a reset.  ... 
doi:10.1006/inco.1997.2648 fatcat:cbz4m7x7ujbozlove6gsfrys7q

Efficient learning of typical finite automata from random walks

Yoav Freund, Michael Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, Linda Sellie
1993 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93  
This paper describes new and efficient algorithms for learning deterministic finite automata.  ...  behavior on a random input sequence.  ...  In a related setting, Rivest and Schapire [20] introduced the idea of using a homing sequence for learning finite automata in the absence of a reset.  ... 
doi:10.1145/167088.167191 dblp:conf/stoc/FreundKRRSS93 fatcat:oghul2lacrhibnuk4tpeqetasa

Fault Diagnosis in Regenerative Braking System of Hybrid Electric Vehicles by Using Semigroup of Finite-State Deterministic Fully Intuitionistic Fuzzy Automata

Sajida Kousar, Farah Aslam, Nasreen Kausar, Dragan Pamucar, Gezahagne Mulat Addis, Daqing Gong
2022 Computational Intelligence and Neuroscience  
For such an inference system, finite-state deterministic fully intuitionistic fuzzy automata (FDFIFA) are established.  ...  The method may be used to evaluate faults in a wide range of systems, including autos and aerospace systems.  ...  set of finite strings (words/ sequences of input letters (symbols)) accepted by the automata.  ... 
doi:10.1155/2022/3684727 pmid:35498169 pmcid:PMC9054423 fatcat:uuvu5vmxbzchfnigzugc7c2nyy

A Study of Autonomous Agent Navigation Algorithms in the ANIMAT Environment [chapter]

Arthur Pchelkin, Arkady Borisov
2002 Research and Development in Intelligent Systems XVIII  
This paper is dealt with the examination of possibilities of the algorithm of autonomous agent navigation.  ...  The effectiveness of the suggested algorithm is tested via practical experiments.  ...  In this paper it is proposed to construct such algorithm by employing inference of finite automata using homing sequences [8] .  ... 
doi:10.1007/978-1-4471-0119-2_11 fatcat:mgxoncdbo5dgrojqtddia3shqa

Recognizing user activities in smart environments with automatically constructed fuzzy finite automata
IJARCCE - Computer and Communication Engineering

H.KARAMATH ALI, DR. D.I.GEORGE AMALARETHINAM
2014 IJARCCE  
The system can use the previous inputs upto the most recent one to decide which activity is performed. But, the system should not wait for future inputs for making decisions.  ...  This paper proposes an extension of the earlier methods for automatically constructing an automaton for online recognition of user activities.  ...  The main objective of this research work is to explore the use of finite automata for activity recognition. So, earlier works that used finite automata are given below.  ... 
doi:10.17148/ijarcce.2014.31233 fatcat:ygx4bbw4qfb7tcv572nyywhjgm

Natural Colors of Infinite Words [article]

Rüdiger Ehlers, Sven Schewe
2022 arXiv   pre-print
While finite automata have minimal DFAs as a simple and natural normal form, deterministic omega-automata do not currently have anything similar.  ...  This raises the question of whether or not a concept such as a natural color of an infinite word (for a given language) exists, and, if it does, how it relates back to automata.  ...  Preliminaries Given a set S, we denote the set of finite sequences (words) of elements in S as S * and the set of infinite sequences of elements in S as S ω .  ... 
arXiv:2207.11000v1 fatcat:tdqwdfxrbbfyrk3rtixt5h7rfy

Reverse Engineering of Protocols from Network Traces

Joao Antunes, Nuno Neves, Paulo Verissimo
2011 2011 18th Working Conference on Reverse Engineering  
To address these issues, we propose a new methodology to automatically infer a specification of a protocol from network traces, which generates automata for the protocol language and state machine.  ...  Our results show that the inferred specification is a good approximation of the reference specification, exhibiting a high level of precision and recall.  ...  Grammars can be represented by deterministic Finite State Machine (FSM) automata, which are commonly used to describe language recognizers, i.e., computational functions that determine whether a sequence  ... 
doi:10.1109/wcre.2011.28 dblp:conf/wcre/AntunesNV11 fatcat:67hamydjdbblhn6p2ua2gydf3i
« Previous Showing results 1 — 15 out of 1,770 results