14 search results - page 1 / 3 » On Regularity of Unary Probabilistic Automata |
JALC
2007
13 years 4 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
FUIN
2007
13 years 4 months ago
2007
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
TCS
2008
13 years 3 months ago
2008
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
QEST
2008
IEEE
13 years 10 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been deļ¬ned in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...