Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,966,522 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
Approach to infants and children with Cyanotic congenital heart disease
Zulfikar Ahamed
,
Z. S. Ahmad
,
T. Abhilash
2016
Corpus ID: 163274352
Cyanosis is the bluish discoloration of skin and mucus membranes of tongue, lips, buccal mucosa and conjunctiva resulting from…
Expand
2016
2016
Print the Legend; The Hollywood Frontier Editor
K. Scott
2016
Corpus ID: 193696747
Western motion pictures and television programs produced during the twentieth century developed recognizable tropes for several…
Expand
2013
2013
Data clustering using particle swarm optimization and bee algorithm
C. A. Dhote
,
A. Thakare
,
S. Chaudhari
International Conference on Computing…
2013
Corpus ID: 16524230
Clustering is the process of organising data into meaningful groups, and these groups are called clusters. It is a way of…
Expand
2011
2011
Automatic Number Plate Recognition System
A. Badr
,
M. Abdelwahab
,
A. Thabet
,
Ahmed Abdelsadek
2011
Corpus ID: 34218278
Automatic recognition of car license plate number became a very important in our daily life because of the unlimited increase of…
Expand
2009
2009
ANALITICAL FRAMEWORK OF FDI DETERMINANTS : IMPLEMENTATION OF THE OLI MODEL UDC 339 . 727
Suzana Stefanovi
2009
Corpus ID: 49227493
The paper represents the author's attempt to stress the importance of foreign direct investment (FDI) as the key factor of…
Expand
2006
2006
THORACIC SPINE TUBERCULOSIS PRESENTING WITH CHRONIC NAUSEA AND ABDOMINAL PAIN
A. R. Badoo
,
T. Dar
2006
Corpus ID: 74270535
with, clinical kyphosis (95%), palpable cold abscess (20%), radiological perivertebral abscesses (21%), sinuses (13%), extra…
Expand
2005
2005
Separability of rational subsets by recognizable subsets is decidable in A ∗ × N m
C. Choffrut
,
S. Grigorieff
2005
Corpus ID: 1830450
Given a direct product of monoids M = A∗ ×N where A is finite and N is the additive monoid of nonnegative integers, the following…
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
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
1979
1979
Le théorème de transversale rationnelle dans les langages d'arbres
A. Arnold
Mathematical Systems Theory
1979
Corpus ID: 30044582
We prove that ifφ is a linear homomorphism between the setsT∑ andTΔ of trees built up from the graded alphabets ∑ and Δ then…
Expand
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