Skip to search formSkip to main content

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

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

2016

2016

We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA… Expand

Is this relevant?

2012

2012

Condon and Lipton (FOCS 1989) showed that the class of languages having a space-bounded interactive proof system (IPS) is a… Expand

Is this relevant?

2010

2010

A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes… Expand

Is this relevant?

2010

2010

FLATA is a toolset for the manipulation and the analysis of non-deterministic integer programs (also known as counter automata… Expand

Is this relevant?

2008

2008

We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

This paper argues that flatness appears as a central notion in the
verification of counter automata. A counter automaton is… Expand

Is this relevant?

2004

2004

We prove that a group G has a word problem that is accepted by a deterministic counter automaton with a weak inverse property if… Expand

Is this relevant?

2001

2001

This paper investigates closure property of the classes of sets accepted by space-bounded two-dimensional alternating Turing… Expand

Is this relevant?

1993

1993

a) f1(x, y) = 5x + y ∀x, y ≥ 0 b) f2(x, y) = x− 2y ∀y ≥ 0, x ≥ 2y c) f3(x, y) = x · y ∀x, y ≥ 0 Here you may want to use… Expand

Is this relevant?

1978

1978

Correction of a string x into a language L is the problem of finding a string $y \in L$ to which x can be edited at least cost… Expand

Is this relevant?