X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (5106) 5106
Conference Proceeding (1575) 1575
Book Chapter (180) 180
Dissertation (158) 158
Book / eBook (115) 115
Newspaper Article (23) 23
Magazine Article (18) 18
Government Document (14) 14
Publication (14) 14
Newsletter (8) 8
Reference (4) 4
Book Review (2) 2
Paper (2) 2
Web Resource (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
finite automata (1459) 1459
automata (1305) 1305
computer science (1062) 1062
computer science, theory & methods (1061) 1061
algorithms (766) 766
analysis (712) 712
robots (679) 679
mathematics (653) 653
mathematical models (649) 649
mathematical analysis (587) 587
engineering, electrical & electronic (569) 569
finite state automata (561) 561
finite element method (544) 544
computer simulation (537) 537
mathematics, applied (489) 489
cellular automata (421) 421
finite state machines (414) 414
simulation (404) 404
complexity (348) 348
computer science, information systems (325) 325
finite state machine (320) 320
finite automaton (303) 303
studies (299) 299
computer science, software engineering (292) 292
computer science, hardware & architecture (287) 287
computer science, artificial intelligence (284) 284
materials science, multidisciplinary (281) 281
automation (278) 278
theoretical computer science (277) 277
endlicher automat (269) 269
usage (258) 258
artificial intelligence (257) 257
research (256) 256
finite element analysis (238) 238
finite-elemente-methode (230) 230
automation & control systems (215) 215
engineering (213) 213
mechanics (210) 210
computation (209) 209
optimization (206) 206
regular languages (206) 206
automata theory (203) 203
computer science, interdisciplinary applications (196) 196
logic (189) 189
microstructure (175) 175
languages (174) 174
methods (173) 173
metallurgy & metallurgical engineering (170) 170
formal languages and automata theory (162) 162
finite (160) 160
finite-state automata (157) 157
software (155) 155
algebra (154) 154
formal languages (151) 151
systems (149) 149
cellular automaton (148) 148
solidification (147) 147
evolution (146) 146
regular expressions (146) 146
supervisory control (144) 144
deterministic finite automata (138) 138
control systems (137) 137
equivalence (135) 135
finite-state machines (133) 133
state complexity (133) 133
theory of computation (131) 131
physics (129) 129
discrete event systems (128) 128
computational modeling (126) 126
mathematics, interdisciplinary applications (124) 124
hardware (121) 121
deformation (120) 120
dynamics (120) 120
testing (120) 120
design (117) 117
prediction (117) 117
minimization (116) 116
computational complexity (115) 115
pattern matching (115) 115
deterministic finite automaton (114) 114
mikrostruktur (114) 114
algorithm (113) 113
software engineering (111) 111
discrete-event systems (109) 109
neural networks (109) 109
verification (109) 109
mechanical engineering (108) 108
regular expression (107) 107
automatentheorie (106) 106
descriptional complexity (106) 106
telecommunications (104) 104
humans (101) 101
behavior (100) 100
dynamical systems (98) 98
finite difference method (98) 98
finite state automaton (98) 98
model checking (98) 98
growth (96) 96
mathematical model (94) 94
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Gerstein Science - Stacks (45) 45
Mathematical Sciences - Stacks (27) 27
Engineering & Comp. Sci. - Stacks (26) 26
UTL at Downsview - May be requested (14) 14
Collection Dvlpm't (Acquisitions) - Vendor file (5) 5
UofT at Mississauga - Stacks (4) 4
UofT at Scarborough - Stacks (4) 4
Collection Dvlpm't (Acquisitions) - Closed Orders (3) 3
Online Resources - Online (2) 2
Gerstein Science - Periodical Stacks (1) 1
Mathematical Sciences - Processing (1) 1
Physics - Stacks (1) 1
Robarts - Stacks (1) 1
Trinity College (John W Graham) - Storage (1) 1
UofT at Scarborough - May be requested in 6-10 wks (1) 1
more...
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (6996) 6996
Japanese (87) 87
French (74) 74
Chinese (31) 31
Portuguese (26) 26
Russian (24) 24
Spanish (22) 22
Czech (20) 20
German (14) 14
Korean (8) 8
Polish (3) 3
Indonesian (2) 2
Slovenian (2) 2
Swedish (2) 2
Arabic (1) 1
Catalan (1) 1
Croatian (1) 1
Romanian (1) 1
Slovak (1) 1
Turkish (1) 1
Vietnamese (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


1976, Macmillan computer science series., ISBN 9780333153987, 170
Book
1976, Macmillan computer science series., ISBN 9780333153987, 170
Book
Nuclear instruments & methods in physics research. Section A, Accelerators, spectrometers, detectors and associated equipment, ISSN 0168-9002, 2016, Volume 832, Issue C, pp. 219 - 230
We explore the Micron Automata Processor (AP) as a suitable commodity technology that can address the growing computational needs of pattern recognition in High Energy Physics (HEP) experiments... 
Tracking | Trigger | Pattern recognition | Finite automata | INSTRUMENTS & INSTRUMENTATION | NUCLEAR SCIENCE & TECHNOLOGY | PHYSICS, NUCLEAR | PHYSICS, PARTICLES & FIELDS | Usage | Analysis | Robots | INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND TECHNOLOGY | PHYSICS OF ELEMENTARY PARTICLES AND FIELDS | finite automata | trigger | tracking | pattern recognition
Journal Article
Information and computation, ISSN 0890-5401, 2011, Volume 209, Issue 3, pp. 456 - 470
Finite automata are probably best known for being equivalent to right-linear context-free grammars and, thus, for capturing the lowest level of the Chomsky-hierarchy, the family of regular languages... 
Determinism | Descriptional complexity | Survey | Alternation | Finite automata | Nondeterminism | Computational complexity | MATHEMATICS, APPLIED | EQUIVALENCE | DECISION-PROBLEMS | NONDETERMINISTIC STATE | BOOLEAN AUTOMATA | LOWER BOUNDS | UNARY AUTOMATA | REGULAR LANGUAGES | SUCCINCT REPRESENTATION | COMPUTER SCIENCE, THEORY & METHODS | CONTAINMENT PROBLEMS | CONTEXT-FREE LANGUAGES | Surveys | Robots
Journal Article
Information and computation, ISSN 0890-5401, 2019, Volume 265, pp. 94 - 111
We contribute new relations to the taxonomy of different conversions from regular expressions to equivalent finite automata... 
Finite automata | Regular languages | Regular expressions | PARTIAL DERIVATIVES | GLUSHKOV | FOLLOW | MATHEMATICS, APPLIED | COMPUTER SCIENCE, THEORY & METHODS | Robots
Journal Article
Current Science, ISSN 0011-3891, 2018, Volume 115, Issue 11, pp. 2042 - 2051
Journal Article
2004, ISBN 9781584882558, 321
Interest in finite automata theory continues to grow, not only because of its applications in computer science, but also because of more recent applications in mathematics, particularly group theory... 
Machine theory
eBook
International Journal of Bifurcation and Chaos, ISSN 0218-1274, 01/2016, Volume 26, Issue 1, p. 1650019
.... Previous models of actin automata consider momentary state transitions of nodes. We enrich the actin automata model by assuming that states of nodes depend not only on... 
dynamics | memory | polymers | automata | Actin | CELLULAR-AUTOMATA | COMPLEX | CYTOSKELETON | MICROTUBULES | MULTIDISCIPLINARY SCIENCES | QUANTUM COMPUTATION | PATHOLOGY | MODEL | MATHEMATICS, INTERDISCIPLINARY APPLICATIONS | BREATHERS | Muscle proteins | Analysis | Robots
Journal Article
Information and Computation, ISSN 0890-5401, 04/2018, Volume 259, pp. 259 - 276
A k-limited automaton is a linear bounded automaton that may rewrite each tape cell only in the first k visits, where k... 
Descriptional complexity | Limited automata | Pushdown automata | Simulation | Finite automata | Unary languages | MATHEMATICS, APPLIED | OPERATIONS | LANGUAGES | STATE COMPLEXITY | UNARY AUTOMATA | PUSHDOWN-AUTOMATA | COMPUTER SCIENCE, THEORY & METHODS | SIMULATIONS
Journal Article
1974, Pure and applied mathematics, a series of monographs and textbooks, Volume 58-59
Book
ACM Transactions on Computational Logic (TOCL), ISSN 1529-3785, 12/2017, Volume 18, Issue 4, pp. 1 - 44
.... While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average... 
quantitative properties | nested automata | Weighted automata | model measuring | Nested automata | Model measuring | Quantitative properties | FINITE AUTOMATA | COMPUTER SCIENCE, THEORY & METHODS | LOGIC
Journal Article
Information and computation, ISSN 0890-5401, 2003, Volume 186, Issue 1, pp. 140 - 162
Journal Article
IEEE transactions on computers, ISSN 0018-9340, 2009, Volume 58, Issue 6, pp. 721 - 727
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 05/2015, Volume 578, pp. 13 - 29
We study the problem of trimming visibly pushdown automata (VPA). We first describe a polynomial time procedure which, given a visibly pushdown automaton... 
Visibly pushdown automata | Trimming | COMPUTER SCIENCE, THEORY & METHODS | FINITE | Robots | Construction | Polynomials | Equivalence | Buildings
Journal Article
International Journal of Foundations of Computer Science, ISSN 0129-0541, 11/2012, Volume 23, Issue 7, pp. 1555 - 1578
Journal Article
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.