Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata"

Simple item page
dc.creatorMasopust, Tomas
dc.date2009-05-26
dc.date.accessioned2026-07-07T13:18:13Z
dc.date.available2026-07-07T13:18:13Z
dc.descriptionThis paper gives answers to questions formulated as open in the paper "On State Observability in Deterministic Finite Automata" by A. Mateescu and Gh. Paun. Specifically, it demonstrates that for all k >= 2, the families of regular languages acceptable by deterministic finite automata with no more than k semi-observable states, denoted by Tk, are anti-AFL's, and that the family T1 differs in the closure property under Kleene +.
dc.identifierhttps://arxiv.org/abs/0905.4193
dc.identifierhttp://arxiv.org/abs/0905.4193
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/231362
dc.subjectFormal Languages and Automata Theory
dc.subjectF.4.3
dc.titleAnswers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata"
dc.typetext

Files

Collections

arXiv