Detail publikace

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

MASOPUST, T. Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata". 2009. p. 0-0.
Typ
různé
Jazyk
anglicky
Autoři
Masopust Tomáš, doc. RNDr., Ph.D. (CK-SZZ)
URL
Klíčová slova

Finite automata, state observability, observable states, semi-observable states, closure properties, subregular languages, infinite hierarchy.

Abstrakt

This paper gives answers to questions formulated as open in the paper "OnState Observability in Deterministic Finite Automata" by A. Mateescu and Gh.Paun. Specifically, it demonstrates that for all k >= 2, the families ofregular languages acceptable by deterministic finite automata with no more thank semi-observable states, denoted by Tk, are anti-AFL's, and that the family T1differs in the closure property under Kleene +.

Rok
2009
Strany
6
BibTeX 
@misc{BUT192682,
  author="Tomáš {Masopust}",
  title="Answers to Questions Formulated in the Paper {"}On States Observability in Deterministic Finite Automata{"}",
  year="2009",
  pages="6",
  url="http://arxiv.org/abs/0905.4193",
  note="miscellaneous"
}
Nahoru