Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,376,793 papers from all fields of science
Search
Sign In
Create Free Account
Recognizable set
Known as:
Recognizable (disambiguation)
In computer science, more precisely in automata theory, a recognizable set of a monoid is a subset that can be distinguished by some morphism to a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Automata theory
Computability theory
Computer science
Formal language
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The Attitudes of University Faculty toward Humor as a Pedagogical Tool: Can We Take a Joke?.
John A. Huss
,
Shannon Eastep
2016
Corpus ID: 58910986
Faculty members in a College of Education responded to a mixed methods questionnaire regarding their attitudes toward the use of…
Expand
Review
2015
Review
2015
Accuracy, Coherence, and Evidence
Branden Fitelson
,
K. Easwaran
2015
Corpus ID: 16020214
Taking Joyce’s (1998; 2009) recent argument(s) for probabilism as our point of departure, we propose a new way of grounding…
Expand
2012
2012
Model-Checking of Ordered Multi-Pushdown Automata
M. Atig
Log. Methods Comput. Sci.
2012
Corpus ID: 1608033
We address the verification problem of ordered multi-pushdown automata: A multi-stack extension of pushdown automata that comes…
Expand
2001
2001
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
D. Kuske
International Conference on Developments in…
2001
Corpus ID: 9862644
It is shown that any recognizable set of finite N-free pomsets is axiomatizable in counting monadic second order logic…
Expand
2001
2001
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
R. Morin
Foundations of Software Science and Computation…
2001
Corpus ID: 6722293
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model…
Expand
1998
1998
Commutativity in Free Inverse Monoids
C. Choffrut
,
Flavio D'Alessandro
Theoretical Computer Science
1998
Corpus ID: 23856651
1997
1997
Rational tree relations
J. Raoult
1997
Corpus ID: 2830965
We investigate forests and relations on trees generated by grammars in which the non-terminals represent relations. This…
Expand
1992
1992
On finitely recognizable semigroups
A. Luca
,
S. Varricchio
Acta Informatica
1992
Corpus ID: 32031663
We analyze some algebraic properties of semigroups whose finite subsets are recognizable (finitely recognizable semigroups). We…
Expand
Highly Cited
1980
Highly Cited
1980
A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup
A. Luca
,
A. Restivo
Information and Control
1980
Corpus ID: 45230386
Highly Cited
1974
Highly Cited
1974
A Generalized Approach to Formal Languages
Tom Maibaum
Journal of computer and system sciences (Print)
1974
Corpus ID: 7975687
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE