Relevant bibliographies by topics / Counting-set automata

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Counting-set automata'

Author: Grafiati
Published: 28 June 2021
Last updated: 29 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Counting-set automata.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Counting-set automata"

1

Turoňová, Lenka, Lukáš Holík, Ondřej Lengál, Olli Saarikivi, Margus Veanes, and Tomáš Vojnar. "Regex matching with counting-set automata." Proceedings of the ACM on Programming Languages 4, OOPSLA (2020): 1–30. http://dx.doi.org/10.1145/3428286.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

SCHEICHER, KLAUS, and JÖRG M. THUSWALDNER. "Canonical number systems, counting automata and fractals." Mathematical Proceedings of the Cambridge Philosophical Society 133, no. 1 (2002): 163–82. http://dx.doi.org/10.1017/s0305004102005856.

Full text
Abstract:
In this paper we study properties of the fundamental domain [Fscr ]β of number systems, which are defined in rings of integers of number fields. First we construct addition automata for these number systems. Since [Fscr ]β defines a tiling of the n-dimensional vector space, we ask, which tiles of this tiling ‘touch’ [Fscr ]β. It turns out that the set of these tiles can be described with help of an automaton, which can be constructed via an easy algorithm which starts with the above-mentioned addition automaton. The addition automaton is also useful in order to determine the box counting dimen
APA, Harvard, Vancouver, ISO, and other styles
3

HOLZER, MARKUS, and SEBASTIAN JAKOBI. "FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS." International Journal of Foundations of Computer Science 24, no. 07 (2013): 1083–97. http://dx.doi.org/10.1142/s0129054113400327.

Full text
Abstract:
We introduce E-equivalence, which is a straightforward generalization of almost-equivalence. While almost-equivalence asks for ordinary equivalence up to a finite number of exceptions, in E-equivalence these exceptions or errors must belong to a (regular) set E. The computational complexity of deterministic finite automata (DFAs) minimization problems and their variants w.r.t. almost- and E-equivalence are studied. We show that there is a significant difference in the complexity of problems related to almost-equivalence, and those related to E-equivalence. Moreover, since hyper-minimal and E-m
APA, Harvard, Vancouver, ISO, and other styles
4

Calautti, Marco, Ester Livshits, Andreas Pieris, and Markus Schneider. "Combined Approximations for Uniform Operational Consistent Query Answering." Proceedings of the ACM on Management of Data 2, no. 2 (2024): 1–16. http://dx.doi.org/10.1145/3651600.

Full text
Abstract:
Operational consistent query answering (CQA) is a recent framework for CQA based on revised definitions of repairs, which are built by applying a sequence of operations (e.g., fact deletions) starting from an inconsistent database until we reach a database that is consistent w.r.t. the given set of constraints. It has been recently shown that there is an efficient approximation for computing the percentage of repairs that entail a given query when we focus on primary keys, conjunctive queries, and assuming the query is fixed (i.e., in data complexity). However, it has been left open whether su
APA, Harvard, Vancouver, ISO, and other styles
5

Marchant, Ross, Martin Tetard, Adnya Pratiwi, Michael Adebayo, and Thibault de Garidel-Thoron. "Automated analysis of foraminifera fossil records by image classification using a convolutional neural network." Journal of Micropalaeontology 39, no. 2 (2020): 183–202. http://dx.doi.org/10.5194/jm-39-183-2020.

Full text
Abstract:
Abstract. Manual identification of foraminiferal morphospecies or morphotypes under stereo microscopes is time consuming for micropalaeontologists and not possible for nonspecialists. Therefore, a long-term goal has been to automate this process to improve its efficiency and repeatability. Recent advances in computation hardware have seen deep convolutional neural networks emerge as the state-of-the-art technique for image-based automated classification. Here, we describe a method for classifying large foraminifera image sets using convolutional neural networks. Construction of the classifier
APA, Harvard, Vancouver, ISO, and other styles
6

Stanojcic, Nick, Eduardo Mangieri, Nathan Little, and David O’Brart. "A new software for automated counting of glistenings in intraocular lenses in vivo." International Journal of Ophthalmology 16, no. 8 (2023): 1237–42. http://dx.doi.org/10.18240/ijo.2023.08.08.

Full text
Abstract:
AIM: To assess the performance of a bespoke software for automated counting of intraocular lens (IOL) glistenings in slit-lamp images. METHODS: IOL glistenings from slit-lamp-derived digital images were counted manually and automatically by the bespoke software. The images of one randomly selected eye from each of 34 participants were used as a training set to determine the threshold setting that gave the best agreement between manual and automatic grading. A second set of 63 images, selected using randomised stratified sampling from 290 images, were used for software validation. The images we
APA, Harvard, Vancouver, ISO, and other styles
7

Casas, Gianmarco Goycochea, Zool Hilmi Ismail, Mathaus Messias Coimbra Limeira, Antonilmar Araújo Lopes da Silva, and Helio Garcia Leite. "Automatic Detection and Counting of Stacked Eucalypt Timber Using the YOLOv8 Model." Forests 14, no. 12 (2023): 2369. http://dx.doi.org/10.3390/f14122369.

Full text
Abstract:
The objective of this project was to automate the detection and counting process of stacked eucalypt (hybrid Eucalyptus urophylla x Eucalyptus grandis) timber in the forestry industry using the YOLOv8 model. The dataset consists of 230 diverse images of eucalypt roundwood, including images of roundwood separated on a rail and stacked timber. The annotations were made using LabelImg, ensuring accurate delineation of target objects on the log surfaces. The YOLOv8 model is customized with a CSPDarknet53 backbone, C2f module, and SPPF layer for efficient computation. The model was trained using an
APA, Harvard, Vancouver, ISO, and other styles
8

Ying, Yu Ming, and Xiao Hong Yang. "Automatic Counting System Based on MCU." Applied Mechanics and Materials 273 (January 2013): 547–50. http://dx.doi.org/10.4028/www.scientific.net/amm.273.547.

Full text
Abstract:
For the low accuracy and low efficiency of artificial counting problem, we introduced a set of automatic counting system which can be applied in the particulate workpiece counting. With infrared transmitting and receiving module as sensor, when a workpiece passes through the surveyed area, the light will be blocked by the workpiece and the receiving module will emit a pulse signal, the counting for the passing workpiece just is the workpiece number. This text make detailed introduction to the hardware circuit and software design and An on-line type automatic control photoelectric counter syste
APA, Harvard, Vancouver, ISO, and other styles
9

Khan, Ahad Mahmud, Salahuddin Ahmed, Nabidul Haque Chowdhury, et al. "Developing a video expert panel as a reference standard to evaluate respiratory rate counting in paediatric pneumonia diagnosis: protocol for a cross-sectional study." BMJ Open 12, no. 11 (2022): e067389. http://dx.doi.org/10.1136/bmjopen-2022-067389.

Full text
Abstract:
IntroductionManual counting of respiratory rate (RR) in children is challenging for health workers and can result in misdiagnosis of pneumonia. Some novel RR counting devices automate the counting of RR and classification of fast breathing. The absence of an appropriate reference standard to evaluate the performance of these devices is a challenge. If good quality videos could be captured, with RR interpretation from these videos systematically conducted by an expert panel, it could act as a reference standard. This study is designed to develop a video expert panel (VEP) as a reference standar
APA, Harvard, Vancouver, ISO, and other styles
10

Cao, Libo, Liping Zeng, Yaoxuan Wang, et al. "U2-Net and ResNet50-Based Automatic Pipeline for Bacterial Colony Counting." Microorganisms 12, no. 1 (2024): 201. http://dx.doi.org/10.3390/microorganisms12010201.

Full text
Abstract:
In this paper, an automatic colony counting system based on an improved image preprocessing algorithm and convolutional neural network (CNN)-assisted automatic counting method was developed. Firstly, we assembled an LED backlighting illumination platform as an image capturing system to obtain photographs of laboratory cultures. Consequently, a dataset was introduced consisting of 390 photos of agar plate cultures, which included 8 microorganisms. Secondly, we implemented a new algorithm for image preprocessing based on light intensity correction, which facilitated clearer differentiation betwe
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Counting-set automata"

1

Horký, Michal. "Rychlejší než grep pomocí čítačů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445473.

Full text
Abstract:
Vyhledávání regulárních výrazů má ve vývoji softwaru nezastupitelné místo. Rychlost vyhledávání může ovlivnit použitelnost softwaru, a proto je na ni kladen velký důraz. Pro určité druhy regulárních výrazů mají standardní přístupy pro vyhledávání vysokou složitost. Kvůli tomu jsou náchylné k útokům založeným na vysoké náročnosti vyhledávání regulárních výrazů (takzvané ReDoS útoky). Regulární výrazy s omezeným opakováním, které se v praxi často vyskytují, jsou jedním z těchto druhů. Efektivní reprezentace a rychlé vyhledávání těchto regulárních výrazů je možné s použítím automatu s čítači. V t
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Counting-set automata"

1

Holík, Lukáš, Juraj Síč, Lenka Turoňová, and Tomáš Vojnar. "Fast Matching of Regular Patterns with Synchronizing Counting." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30829-1_19.

Full text
Abstract:
AbstractFast matching of regular expressions with bounded repetition, aka counting, such as $$\texttt {(ab)\{50,100\}}$$ ( ab ) { 50 , 100 } , i.e., matching linear in the length of the text and independent of the repetition bounds, has been an open problem for at least two decades. We show that, for a wide class of regular expressions with counting, which we call synchronizing, fast matching is possible. We empirically show that the class covers nearly all counting used in usual applications of regex matching. This complexity result is based on an improvement and analysis of a recent matching
APA, Harvard, Vancouver, ISO, and other styles
2

Pan, Minghua, Hengbing Wei, and Shaohua Sun. "Application of Typical Set on Automatic Counting of Round Brilliant Cut Gems." In Communications in Computer and Information Science. Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-2260-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Yangjun. "A New Algorithm for Subset Matching Problem Based on Set-String Transformation." In Encyclopedia of Information Communication Technology. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-59904-845-1.ch080.

Full text
Abstract:
In computer engineering, a number of programming tasks involve a special problem, the so-called tree matching problem (Cole & Hariharan, 1997), as a crucial step, such as the design of interpreters for nonprocedural programming languages, automatic implementation of abstract data types, code optimization in compilers, symbolic computation, context searching in structure editors and automatic theorem proving. Recently, it has been shown that this problem can be transformed in linear time to another problem, the so called subset matching problem (Cole & Hariharan, 2002, 2003), which is t
APA, Harvard, Vancouver, ISO, and other styles
4

Turing, Alan. "Lecture on the Automatic Computing Engine (1947)." In The Essential Turing. Oxford University Press, 2004. http://dx.doi.org/10.1093/oso/9780198250791.003.0015.

Full text
Abstract:
On 8 December 1943 the world’s first large-scale special-purpose electronic digital computer—‘Colossus’, as it became known—went into operation at the Government Code and Cypher School (see ‘Computable Numbers: A Guide’, ‘Enigma’, and the introduction to Chapter 4). Colossus was built by Thomas H. Flowers and his team of engineers at the Post Office Research Station in Doll is Hill, London. Until relatively recently, few had any idea that electronic digital computation was used successfully during the Second World War, since those who built and worked with Colossus were prohibited by the Offic
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Counting-set automata"

1

Popescu, Andrei, and Johannes P. Wallner. "Advancing Algorithmic Approaches to Probabilistic Argumentation under the Constellation Approach." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/55.

Full text
Abstract:
Reasoning with defeasible and conflicting knowledge in an argumentative form is a key research field in computational argumentation. Reasoning under various forms of uncertainty is both a key feature and a challenging barrier for automated argumentative reasoning. It was shown that argumentative reasoning using probabilities faces in general high computational complexity, in particular for the so-called constellation approach. In this paper, we develop an algorithmic approach to overcome this obstacle. We refine existing complexity results and show that two main reasoning tasks, that of comput
APA, Harvard, Vancouver, ISO, and other styles
2

Khan, Sana Ullah, Naveed Islam, Zahoor Jan, Hameed Ullah Shah, and Aziz ud Din. "Automated Counting of Cells in Breast Cytology Images Using Level Set Method." In 2018 IEEE 20th International Conference on High Performance Computing and Communications; IEEE 16th International Conference on Smart City; IEEE 4th International Conference on Data Science and Systems (HPCC/SmartCity/DSS). IEEE, 2018. http://dx.doi.org/10.1109/hpcc/smartcity/dss.2018.00258.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ryu, Jisu, Seojin Kim, Christopher H. Kang, and Jaeheum Baek. "Automated Cell Layer Counting and Marking at Target Layer of 3D NAND TEM Samples by Focused Ion Beam." In ISTFA 2021. ASM International, 2021. http://dx.doi.org/10.31399/asm.cp.istfa2021p0347.

Full text
Abstract:
Abstract This paper discusses the development of an automated cell layer counting process for preparing 3D NAND flash memory samples for TEM analysis. In an initial proof-of-concept, several line markings were inscribed on the test device in evenly spaced intervals in order to evaluate its helpfulness for a human operator. A more automated procedure was then developed in which cell layers were counted to a desired target layer starting from a reference layer set by the operator. At that point, the operator could begin preparing the TEM sample.
APA, Harvard, Vancouver, ISO, and other styles
4

Porto, João Vitor de Andrade, Fábio Prestes Cesar Rezende, Gilberto Astolfi, Vanessa Aparecida de Moraes Weber, Marcio Carneiro Brito Pache, and Hemerson Pistori. "Automatic counting of cattle with Faster R-CNN on UAV images." In Workshop de Visão Computacional. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/wvc.2021.18880.

Full text
Abstract:
It is remarkable the growth of the bovine herd in the last four decades however, the availability of areas for pasture did not follow the same trend and thus caused direct interference in the binomial quality and price of the final product. One of the ways to get around this interference is by the use of technologies to help minimize the handling costs, from the breeding in a controlled environment with the need of trained manpower in the confinement process. Thus, as opposed to the current format done manually and in restricted space, computer vision technology can mitigate the identification
APA, Harvard, Vancouver, ISO, and other styles
5

Kuželka, Ondřej. "Counting and Sampling Models in First-Order Logic." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/801.

Full text
Abstract:
First-order model counting (FOMC) is the task of counting models of a first-order logic sentence over a given set of domain elements. Its weighted variant, WFOMC, generalizes FOMC by assigning weights to the models and has many applications in statistical relational learning. More than ten years of research by various authors has led to identification of non-trivial classes of WFOMC problems that can be solved in time polynomial in the number of domain elements. In this paper, we describe recent works on WFOMC and the related problem of weighted first-order model sampling (WFOMS). We also disc
APA, Harvard, Vancouver, ISO, and other styles
6

Meel, Kuldeep S. "Counting, Sampling, and Synthesis: The Quest for Scalability." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/817.

Full text
Abstract:
The current generation of symbolic reasoning techniques excel at the qualitative tasks (i.e., when the answer is Yes or No); such techniques sufficed for traditional systems whose design sought to achieve deterministic behavior. In contrast, modern computing systems crucially rely on the statistical methods to account for the uncertainty in the environment, and to reason about behavior of these systems, there is need to look beyond qualitative symbolic reasoning techniques. We will discuss our work focused on the development of the next generation of automated reasoning techniques that can per
APA, Harvard, Vancouver, ISO, and other styles
7

Cui, Zhenhe, Weidu Kuang, and Yongmei Liu. "Automatic Verification for Soundness of Bounded QNP Abstractions for Generalized Planning." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/351.

Full text
Abstract:
Generalized planning (GP) studies the computation of general solutions for a set of planning problems. Computing general solutions with correctness guarantee has long been a key issue in GP. Abstractions are widely used to solve GP problems. For example, a popular abstraction model for GP is qualitative numeric planning (QNP), which extends classical planning with non-negative real variables that can be increased or decreased by some arbitrary amount. The refinement of correct solutions of sound abstractions are solutions with correctness guarantees for GP problems. More recent literature prop
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Counting-set automata' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography