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.

2016

2016

Faculty members in a College of Education responded to a mixed methods questionnaire regarding their attitudes toward the use of… Expand

2012

2012

We address the verification problem of ordered multi-pushdown automata: A multi-stack extension of pushdown automata that comes… Expand

2011

2011

Automatic recognition of car license plate number became a very important in our daily life because of the unlimited increase of… Expand

2005

2005

We analyze some algebraic properties of semigroups whose finite subsets are recognizable (finitely recognizable semigroups). We… Expand

2001

2001

Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model… Expand

2001

2001

It is shown that any recognizable set of finite N-free pomsets is axiomatizable in counting monadic second order logic… Expand

1998

1998

This article characterizes the solutions of the commutativity equation xy = yx in free inverse monoids. The main result implies… Expand

1997

1997

We investigate forests and relations on trees generated by grammars in which the non-terminals represent relations. This… Expand

Highly Cited

1990

Highly Cited

1990

Abstract The notion of a recognizable set of finite graphs is introduced. Every set of finite graphs, that is definable in… Expand

Highly Cited

1980

Highly Cited

1980

A syntactic characterization of strictly locally testable languages is given by means of the concept of constant . If S is a… Expand