Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation… Expand

Highly Cited

2005

Highly Cited

2005

Despite a high and growing global average income, billions of human beings are still condemned to life long severe poverty, with… Expand

Highly Cited

2000

Highly Cited

2000

We show that the boundedness of the set of all products of a given pair Sigma of rational matrices is undecidable. Furthermore… Expand

Highly Cited

1998

Highly Cited

1998

Preface. 1. Preliminaries. 2. Many-Valued Propositional Calculi. 3. Lukasiewicz Propositional Logic. 4. Product Logic, Godel… Expand

Highly Cited

1998

Highly Cited

1998

We study Petri nets with Reset arcs (also Transfer and Doubling arcs) in combination with other extensions of the basic Petri net… Expand

Highly Cited

1994

Highly Cited

1994

The Equality Problem for Rational Series with Multiplicities in the tropical Semiring is Undecidable

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they… Expand

Highly Cited

1992

Highly Cited

1992

Static analysis of programs is indispensable to any software tool, environment, or system that requires compile-time information… Expand

Highly Cited

1972

Highly Cited

1972

USEFUL FACTS ABOUT SETS. SENTENTIAL LOGIC. FIRST-ORDER LOGIC. UNDECIDABILITY. SECOND-ORDER LOGIC.

Highly Cited

1971

Highly Cited

1971

This paper is related to the work of Hao Wang and others growing out of a problem which he proposed in [8], w 4.1. Suppose that… Expand

Highly Cited

1966

Highly Cited

1966

Many cyberinformaticians would agree that, had it not been for amphibious epistemologies, the refinement of randomized algorithms… Expand