On States Observability in Deterministic Finite Automata

DOI10.1080/00207168708803554MaRDI QIDQ3817614zbMATH OpenOpenAlexFDO

Authors Alexandru Mateescu, Gheorghe Păun

Publication date 1987

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168708803554

zbMATH Keywords

regular languagesfinite automatonobservable state

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On a structural property in the state complexity of projected regular languages
• A novel matrix approach to observability analysis of finite automata
• The state complexities of some basic operations on regular languages
• Automata with Extremal Minimality Conditions
• Closure properties of hyper-minimized automata

Cited in

(2)

• scientific article; zbMATH DE number 427961 (Why is no real title available?)
• scientific article; zbMATH DE number 7324596 (Why is no real title available?)

This page was built for publication: On States Observability in Deterministic Finite Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3817614)