Green’s Relations in Deterministic Finite Automata
Sign Up to like & getrecommendations! Published in 2018 at "Theory of Computing Systems"
DOI: 10.1007/s00224-018-9847-4
Abstract: Green’s relations are a fundamental tool in the structure theory of semigroups. They can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes of Green’s relations then correspond to the strongly connected… read more here.
Keywords: green relations; finite automata; relations deterministic; deterministic finite ... See more keywords
IDLIQ: An Incremental Deterministic Finite Automaton Learning Algorithm Through Inverse Queries for Regular Grammar Inference.
Sign Up to like & getrecommendations! Published in 2023 at "Big data"
DOI: 10.1089/big.2022.0158
Abstract: We present an efficient incremental learning algorithm for Deterministic Finite Automaton (DFA) with the help of inverse query (IQ) and membership query (MQ). This algorithm is an extension of the Identification of Regular Languages (ID)… read more here.
Keywords: algorithm inverse; inverse queries; deterministic finite; learning algorithm ... See more keywords