MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "On the Equivalence of -Automata." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

103 documents found, showing 1 through 10. Next 10 →

ATOM

On the equivalence of Z-automata
by Marie-pierre Béal, Jacques Sakarovitch — In ICALP 2005 (2005
…On the equivalence of Z-automata Marie-Pierre Béal 1 ,SylvainLombardy 2 , and Jacques Sakarovitch…
Cited by 1 (0 self) – Add To MetaCart

The equivalence problem of multitape finite automata
by Tero Harju, Juhani Karhumäki — 1991 — Theoretical Computer Science
…The Equivalence Problem of Multitape Finite Automata Tero Harju and Juhani Karhumäki Deptartment…
Cited by 16 (2 self) – Add To MetaCart

Compiling a Partition-Based Two-Level Formalism
by Edmund Grimley-Evans University, Edmund Grimley-evans — 1996 — In COLING-96: Papers Presented to the 16th International Conference on Computational Linguistics
…, but until now it has not been clear how to compile to equivalent automata in a transparent way. The present…
Add To MetaCart

Automata - A Theory Dedicated towards Formal Circuit Synthesis
by Dirk Eisenbiegler — 1997 — In Higher Order Logic Theorem Proving and Its Applications
… . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Equivalence of Automata . . . . . . . . . . . . . . . . . . . . . . 7 2.3 Compound Output…
Cited by 9 (7 self) – Add To MetaCart

The State Explosion Problem From Trace to Bisimulation Equivalence
by F. Laroussinie, Ph. Schnoebelen — 2000 — In Proc. 3rd Int. Conf. Foundations of Software Science and Computation Structures (FOSSACS’2000) (2000
… systems (or equivalently as automata with boolean variables, etc.). We also show that any relation between…
Cited by 1 (0 self) – Add To MetaCart

A HOL Conversion for Translating Linear Time Temporal Logic to omega-Automata
by Klaus Schneider, Dirk W. Hoffmann — 1999 — in Theorem Proving in Higher Order Logics
… into equivalent #-automata. The translation is completely implemented by HOL rules and is therefore safe. Its…
Cited by 24 (4 self) – Add To MetaCart

Yet Another Look at LTL Model Checking
by Klaus Schneider — 1999 — of Lecture Notes in Computer Science
…-time temporal logic LTL are based on a translation to equivalent #-automata. Given an LTL formula #, the states…
Cited by 1 (0 self) – Add To MetaCart

Compiling a Partition-Based Two-Level Formalism
by Edmund Grimley-Evans, George Anton Kiraz, Stephen G. Pulman
… how to compile to equivalent automata in a transparent way. The present paper shows how to do this…
Cited by 11 (6 self) – Add To MetaCart

Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
by Klaus Schneider — 2001 — In LPAR’01, volume 2250 of LNCS
… temporal logic (LTL) formulas with past operators to equivalent ω-automata. The resulting automata…
Cited by 7 (3 self) – Add To MetaCart

The Expressive Power of Transitive Closure and 2-way Multihead Automata
by Yaniv Bargury, Johann Makowsky — 1992 — Lecture Notes in Computer Science 626
… The Expressive Power of Transitive Closure and 2-way Multihead Automata Yaniv Bargury…
Cited by 5 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB