The equivalence problem of multitape finite automata

Harju, Tero; Karhumäki, Juhani

doi:10.1016/0304-3975(91)90356-7

Cited by 113 publications

(53 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Then clearly, ψ( ) = U. We note that [HK91] used this notion of uniformity to prove that the equivalence of multitape finite automata is decidable (also compare [Sak03]). …”

Section: S Mmentioning

confidence: 99%

Weighted automata with discounting

Droste

Sakarovitch

Vogler

2008

Information Processing Letters

View full text Add to dashboard Cite

Abstract:We investigate weighted automata with discounting and their behaviours over semirings and finitely generated graded monoids. We characterize the discounted behaviours of weighted automata precisely as rational formal power series with a discounted form of the Cauchy product. This extends a classical result of Kleene-Schützenberger. Here we show that the very special case of Schützenberger's result for free monoids over singleton alphabets suffices to deduce our generalization.

show abstract

“…Then clearly, ψ( ) = U. We note that [HK91] used this notion of uniformity to prove that the equivalence of multitape finite automata is decidable (also compare [Sak03]). …”

Section: S Mmentioning

confidence: 99%

Weighted automata with discounting

Droste

Sakarovitch

Vogler

2008

Information Processing Letters

View full text Add to dashboard Cite

show abstract

“…The basic variants of such automata are non-deterministic and deterministic, accepting rational relations (Rat) and deterministic rational relations (DRat), respectively. While the equivalence problem of DRat is decidable [17], inclusion is unfortunately undecidable for both classes. Therefore, our proof technique cannot be used to prove decidability of reachability in systems of CFSM or visibly pushdown transducers whose queue languages form (deterministic) rational relations.…”

Section: Relations Over Words and Treesmentioning

confidence: 99%

Asynchronously Communicating Visibly Pushdown Systems

Babić

Rakamarić

2013

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

Abstract.We introduce an automata-based formal model suitable for specifying, modeling, analyzing, and verifying asynchronous task-based and message-passing programs. Our model consists of visibly pushdown automata communicating over unbounded reliable point-to-point firstin-first-out queues. Such a combination unifies two branches of research, one focused on task-based models, and the other on models of messagepassing programs. Our model generalizes previously proposed models that have decidable reachability in several ways. Unlike task-based models of asynchronous programs, our model allows sending and receiving of messages even when stacks are not empty, without imposing restrictions on the number of context-switches or communication topology. Our model also generalizes the well-known communicating finite-state machines with recognizable channel property allowing (1) individual components to be visibly pushdown automata, which are more suitable for modeling (possibly recursive) programs, (2) the set of words (i.e., languages) of messages on queues to form a visibly pushdown language, which permits modeling of remote procedure calls and simple forms of counting, and (3) the relations formed by tuples of such languages to be synchronized, which permits modeling of complex interactions among processes. In spite of these generalizations, we prove that the composite configuration and control-state reachability are still decidable for our model.

show abstract

“…Thus 7)1 and :D2 accept the same inputs if and only if M,(C1) = M,(C2). Since equivalence of deterministic multitape automata is decidable [8], it follows that we can effectively decide whether M8 (C1) = M8 (C2). Since the mapping flwf is bijective, it follows that also the condition (7) is decidable.…”

Section: (U) [:]mentioning

confidence: 99%

“…Contrasting this result it was established in [14] that equivalence of deterministic equality-synchronized automata can be decided effectively. This question was reduced to the equivalence problem for deterministic multitape finite automata which is known to be decidable [8]. An essential part of the proof was the so called normalization property for equality-synchronized automata.…”

Section: Introductionmentioning

confidence: 99%

Decidability of equivalence for deterministic synchronized tree automata

Salomaa

1995

TAPSOFT '95: Theory and Practice of Software Development

View full text Add to dashboard Cite

Abstract. Synchronized tree automata allow limited communication between computations in independent subtrees of the input. This enables them to verify, for instance, the equality of two unary subtrees of unlimited size. The class of tree languages recognized by synchronized tree automata is strictly included in the context-free tree languages. As our main result we show that equivalence of tree languages recognized by deterministic synchronized tree automata can be effectively decided. This contrasts the earlier undecidability result for the equivalence problem for nondeterministic synchronized tree automata.

show abstract

The equivalence problem of multitape finite automata

Cited by 113 publications

References 14 publications

Weighted automata with discounting

Weighted automata with discounting

Asynchronously Communicating Visibly Pushdown Systems

Decidability of equivalence for deterministic synchronized tree automata

Contact Info

Product

Resources

About