![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Abstract
The notion of state observability in systems theory is considered for finite automata and the class of languages recognized by automata with only observable states is investigated. Then one introduces the notion of semi-observable states: their number defines an infinite hierarchy of anti-AFL's in the family of regular languages. The succinctness of considering incompletely specified finite automata is also examined.
Keywords:
C.R. Categories: