Weighted automata extend classical finite automata by assigning weights, typically drawn from algebraic structures such as semirings, to transitions. This quantitative enhancement enables the analysis ...

Regular expressions. Closure properties. Sequential machines and finite state transducers. State minimization. Chomsky hierarchy grammars, pushdown acceptors and linear bounded automata. Closure ...

Automata learning and formal verification represent converging fields aimed at enhancing the reliability and safety of complex systems. Automata learning involves the algorithmic inference of system ...