X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (5364) 5364
Conference Proceeding (1717) 1717
Publication (631) 631
Book Chapter (189) 189
Book / eBook (139) 139
Dissertation (85) 85
Newspaper Article (23) 23
Magazine Article (20) 20
Government Document (14) 14
Paper (8) 8
Newsletter (7) 7
Book Review (4) 4
Reference (4) 4
Technical Report (1) 1
Trade Publication Article (1) 1
Web Resource (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
finite automata (1475) 1475
automata (1302) 1302
computer science (1083) 1083
computer science, theory & methods (1059) 1059
algorithms (755) 755
analysis (715) 715
robots (676) 676
mathematics (675) 675
mathematical models (632) 632
mathematical analysis (584) 584
engineering, electrical & electronic (558) 558
finite state automata (548) 548
computer simulation (502) 502
finite element method (502) 502
mathematics, applied (490) 490
cellular automata (398) 398
finite state machines (393) 393
simulation (382) 382
models (375) 375
complexity (349) 349
computer science, information systems (339) 339
finite state machine (317) 317
studies (305) 305
computer science, software engineering (302) 302
finite automaton (297) 297
computer science, hardware & architecture (288) 288
computer science, artificial intelligence (277) 277
automation (276) 276
theoretical computer science (267) 267
endlicher automat (265) 265
materials science, multidisciplinary (263) 263
artificial intelligence (260) 260
usage (258) 258
research (257) 257
finite-elemente-methode (236) 236
finite element analysis (227) 227
engineering (222) 222
regular languages (212) 212
automation & control systems (209) 209
mechanics (207) 207
computation (205) 205
model (204) 204
computer science, interdisciplinary applications (200) 200
optimization (193) 193
logic (190) 190
languages (189) 189
systems (183) 183
automata theory (179) 179
methods (174) 174
metallurgy & metallurgical engineering (166) 166
microstructure (158) 158
formal languages and automata theory (156) 156
algebra (154) 154
finite-state automata (152) 152
regular expressions (149) 149
software (149) 149
finite-state machines (148) 148
finite (147) 147
formal languages (146) 146
supervisory control (143) 143
deterministic finite automata (141) 141
cellular automaton (140) 140
equivalence (140) 140
evolution (140) 140
solidification (139) 139
state complexity (138) 138
theory of computation (135) 135
control systems (134) 134
physics (133) 133
computational modeling (126) 126
discrete event systems (123) 123
algorithm (121) 121
minimization (121) 121
hardware (119) 119
computational complexity (118) 118
testing (118) 118
deformation (116) 116
design (116) 116
discrete-event systems (116) 116
pattern matching (116) 116
dynamics (115) 115
mikrostruktur (115) 115
mathematics, interdisciplinary applications (113) 113
deterministic finite automaton (111) 111
prediction (111) 111
software engineering (110) 110
mechanical engineering (109) 109
verification (109) 109
automatentheorie (107) 107
descriptional complexity (106) 106
index medicus (106) 106
regular expression (106) 106
neural networks (105) 105
humans (102) 102
telecommunications (101) 101
model checking (100) 100
finite state automaton (99) 99
growth (99) 99
dynamical systems (95) 95
sequential machine theory (94) 94
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Gerstein Science - Stacks (58) 58
Engineering & Comp. Sci. - Stacks (37) 37
Mathematical Sciences - Stacks (31) 31
UTL at Downsview - May be requested (18) 18
Collection Dvlpm't (Acquisitions) - Vendor file (5) 5
UofT at Mississauga - Stacks (5) 5
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
Mathematical Sciences - Reference (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 (6943) 6943
Japanese (92) 92
Chinese (43) 43
French (35) 35
Spanish (21) 21
German (18) 18
Portuguese (17) 17
Russian (12) 12
Korean (8) 8
Polish (3) 3
Slovenian (2) 2
Arabic (1) 1
Catalan (1) 1
Croatian (1) 1
Indonesian (1) 1
Romanian (1) 1
Swedish (1) 1
Turkish (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
Theoretical Computer Science, ISSN 0304-3975, 01/2015, Volume 562, Issue C, pp. 590 - 605
•We proposed a compact method named postfix automata to construct smaller NFAs.•Our method is based on the coded syntax tree of the postfix regular... 
Thompson's automata | Finite automata | Regular expression | Follow automata | TIME | COMPUTER SCIENCE, THEORY & METHODS | REGULAR EXPRESSIONS | NFAS | Robots | Trees | Construction | Automation | Algorithms | Polishes | Mathematical analysis | Construction specifications | Syntax
Journal Article
Nuclear Inst. and Methods in Physics Research, A, ISSN 0168-9002, 10/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... 
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, 03/2011, Volume 209, Issue 3, pp. 456 - 470
Journal Article
Information and Computation, ISSN 0890-5401, 04/2019, Volume 265, pp. 94 - 111
We contribute new relations to the taxonomy of different conversions from regular expressions to equivalent finite automata. In particular, we are interested... 
Finite automata | Regular languages | Regular expressions | PARTIAL DERIVATIVES | GLUSHKOV | FOLLOW | MATHEMATICS, APPLIED | COMPUTER SCIENCE, THEORY & METHODS | Robots
Journal Article
Theory of Computing Systems, ISSN 1432-4350, 07/2018, Volume 62, Issue 5, pp. 1203 - 1222
In this paper, we propose a reduction of the minimization problem for a bottom-up deterministic tree automaton (DFTA), making the latter a minimization of a... 
Minimization | Tree automata | Finite automata | Tree languages | DETERMINISTIC AUTOMATA | BISIMULATION | MATHEMATICS | INCREMENTAL CONSTRUCTION | RANDOM GENERATION | COMPUTER SCIENCE, THEORY & METHODS | Information science | Robots | Construction standards | Transformations | Automata theory | Optimization
Journal Article
Information Sciences, ISSN 0020-0255, 05/2012, Volume 191, pp. 86 - 97
Journal Article
IEEE Transactions on Automatic Control, ISSN 0018-9286, 01/2020, Volume 65, Issue 1, pp. 341 - 346
Critical observability is a property of cyber-physical systems to detect whether the current state belongs to a set of critical states. In safety-critical... 
Computers | Adaptation models | discrete-event systems | finite automata | Computational modeling | Petri nets | Automata | networks of finite automata | Complexity theory | critical observability | Observability | Complexity
Journal Article
NONLINEAR DYNAMICS, ISSN 0924-090X, 11/2019, Volume 98, Issue 3, pp. 2403 - 2421
Chaotic dynamics have been widely applied in various domains such as cryptography, watermarking and optimization algorithms. Enhancing chaotic complexity of... 
Digital chaotic map | SYSTEM | SYNCHRONIZATION | Logistic map | MECHANICS | Tent map | APPROXIMATE ENTROPY | Deterministic finite-state automata (DFSA) | Sine map | ENGINEERING, MECHANICAL
Journal Article
Current Science, ISSN 0011-3891, 2018, Volume 115, Issue 11, pp. 2042 - 2051
omega-automata is a variant of finite automata which accepts infinite strings. It represents the behaviour of the infinite systems (hardware, operating system... 
Co-Büchi automata and Muller automata | Streett automata | Büchi automata | Rabin automata | PARITY GAMES | co-Buchi automata and Muller automata | CONVERSION | MULTIDISCIPLINARY SCIENCES | FINITE AUTOMATA | LANGUAGES | SIMULATION RELATIONS | CONSTRUCTION | Buchi automata | CHECKING | DERIVATIVES | PARALLEL REGULAR EXPRESSIONS
Journal Article
Journal of Computer and System Sciences, ISSN 0022-0000, 12/2015, Volume 81, Issue 8, pp. 1592 - 1613
We prove that finite-state transducers with injective behavior, deterministic or not, real-time or not, with no extra memory or a single counter, cannot... 
Finite automata | Normal numbers | Non-deterministic automata | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | COMPUTER SCIENCE, THEORY & METHODS | Analysis | Robots
Journal Article
Information and Computation, ISSN 0890-5401, 12/2019, p. 104503
Journal Article
Fundamenta Informaticae, ISSN 0169-2968, 2017, Volume 155, Issue 1-2, pp. 31 - 58
A kappa-limited automaton is a linear bounded automaton that may rewrite each tape square only in the first kappa visits, where kappa >= 0 is a fixed constant.... 
SPACE | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | CELLULAR-AUTOMATA | CHURCH-ROSSER LANGUAGES | CONTEXT-SENSITIVE LANGUAGES | FINITE AUTOMATA | COMPUTATIONS | Homomorphisms | Sweeping | Context free languages | Languages | Iterative methods | Automata theory
Journal Article
No results were found for your search.

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