Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Introduction to Automata Theory, Languages, and Computation (view), Tree (automata theory) (view)

searching for Automata theory 126 found (467 total)

Symposium on Foundations of Computer Science (534 words) [view diff] case mismatch in snippet view article find links to article

Design, and in 1966–1974 it was known as the Symposium on Switching and Automata Theory. The current name has been used since 1975. Since 1973, the cover page

Ambiguous grammar (1,820 words) [view diff] exact match in snippet view article find links to article

Hopcroft, John; Motwani, Rajeev; Ullman, Jeffrey (2001). Introduction to automata theory, languages, and computation (2nd ed.). Addison-Wesley. Theorem 9.20

Sheila Greibach (1,329 words) [view diff] case mismatch in snippet view article find links to article

Conference Record of 1966 Seventh Annual Symposium on Switching and Automata Theory, pages 47-52, Berkeley, California, 26–28 October 1966. IEEE. Sheila

Parity game (1,827 words) [view diff] no match in snippet view article find links to article

A parity game is played on a colored directed graph, where each node has been colored by a priority – one of (usually) finitely many natural numbers. Two

Syntactic monoid (1,580 words) [view diff] exact match in snippet view article find links to article

1016/s0019-9958(65)90108-7. Straubing (1994) p.60 Anderson, James A. (2006). Automata theory with modern applications. With contributions by Tom Head. Cambridge:

Grzegorz Rozenberg (951 words) [view diff] exact match in snippet view article find links to article

primary research areas are natural computing, formal language and automata theory, graph transformations, and concurrent systems. He is referred to as

Wang tile (1,495 words) [view diff] exact match in snippet view article find links to article

selected pseudorandomly. Wang tiles have also been used in cellular automata theory decidability proofs. The short story "Wang's Carpets", later expanded

John Rhodes (mathematician) (535 words) [view diff] case mismatch in snippet view article

entire teaching career. In the late 1960s Rhodes wrote Applications of Automata Theory and Algebra: Via the Mathematical Theory of Complexity to Biology,

Rational series (571 words) [view diff] exact match in snippet view article find links to article

ISBN 978-0-521-19022-0. Zbl 1250.68007. Sakarovitch, Jacques (2009). Elements of automata theory. Translated from the French by Reuben Thomas. Cambridge: Cambridge

Larry Stockmeyer (545 words) [view diff] case mismatch in snippet view article find links to article

requires exponential space", Proc. 13th Annual Symposium on Switching and Automata Theory, pp. 125–129, doi:10.1109/SWAT.1972.29. Rajsbaum, Sergio (2004), "Larry

Star height problem (1,353 words) [view diff] exact match in snippet view article find links to article

doi:10.1051/ita:2005027. Sakarovitch, Jacques (2009). Elements of automata theory. Translated from the French by Reuben Thomas. Cambridge: Cambridge

Cycle rank (1,210 words) [view diff] exact match in snippet view article find links to article

relation became known as Eggan's theorem, cf. Sakarovitch (2009). In automata theory, a nondeterministic finite automaton with ε-moves (ε-NFA) is defined

Synchronizing word (882 words) [view diff] case mismatch in snippet view article find links to article

Automata and the Černý Conjecture", Proc. 2nd Int'l. Conf. Language and Automata Theory and Applications (LATA 2008), LNCS, vol. 5196, Springer-Verlag, pp

Moore neighborhood (548 words) [view diff] exact match in snippet view article find links to article

neighborhood is named after Edward F. Moore, a pioneer of cellular automata theory. It is one of the two most commonly used neighborhood types, the other

Moore machine (1,588 words) [view diff] exact match in snippet view article find links to article

student of the fourth year, A. A. Karatsuba, "On a problem from the automata theory", which was distinguished by testimonial reference at the competition

Wolfgang Händler (2,180 words) [view diff] exact match in snippet view article find links to article

Mathematische Maschinen und Datenverarbeitung) known for his work on automata theory, parallel computing, artificial intelligence, man-machine interfaces

Semiautomaton (1,646 words) [view diff] exact match in snippet view article find links to article

{\displaystyle \Sigma } remains finite, and other typical concerns of automata theory remain in play. Thus, the quantum semiautomaton may be simply defined

Concatenation (944 words) [view diff] case mismatch in snippet view article find links to article

Oracle. Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages and Computation. Addison-Wesley. ISBN 0-201-02988-X. Corcoran

Levenshtein automaton (561 words) [view diff] case mismatch in snippet view article find links to article

Automaton and the Size of the Neighbourhood of a Word" (PDF). Language and Automata Theory and Applications. Lecture Notes in Computer Science. Vol. 9618. Lecture

Boolean-valued function (317 words) [view diff] case mismatch in snippet view article find links to article

Publications, Mineola, NY, 2003. Kohavi, Zvi (1978), Switching and Finite Automata Theory, 1st edition, McGraw–Hill, 1970. 2nd edition, McGraw–Hill, 1978. 3rd

Triple bar (1,017 words) [view diff] case mismatch in snippet view article find links to article

Rakesh; Pandey, Adesh; Gupta, Ritu (2006), Discrete Structures and Automata Theory, Alpha Science Int'l Ltd., p. 277, ISBN 978-1-84265-256-5. Weiner,

Extended natural numbers (535 words) [view diff] exact match in snippet view article find links to article

Communications in Algebra. 46 (5). Sakarovitch, Jacques (2009). Elements of automata theory. Translated from the French by Reuben Thomas. Cambridge: Cambridge

Ron Rivest (1,533 words) [view diff] case mismatch in snippet view article find links to article

on Computing. 5 (1): 19–50. doi:10.1137/0205003. MR 0395398. Previously announced at the 15th Annual Symposium on Switching and Automata Theory, 1974.

Hartmut Ehrig (713 words) [view diff] case mismatch in snippet view article find links to article

IEEE Conference Record of 14th Annual Symposium on Switching and Automata Theory (SWAT'08). IEEE. pp. 167–180. doi:10.1109/SWAT.1973.11. Hartmut Ehrig;

In silico (1,439 words) [view diff] no match in snippet view article find links to article

carried out entirely in a computer in 1989, in the workshop "Cellular Automata: Theory and Applications" in Los Alamos, New Mexico, by Pedro Miramontes, a

EXPSPACE (681 words) [view diff] case mismatch in snippet view article find links to article

squaring requires exponential space. 13th IEEE Symposium on Switching and Automata Theory, Oct 1972, pp.125–129. Alur, Rajeev; Henzinger, Thomas A. (1994-01-01)

Glushkov's construction algorithm (1,570 words) [view diff] case mismatch in snippet view article find links to article

S2CID 250833514. Jean-Éric Pin (Nov 2016). Mathematical Foundations of Automata Theory (PDF). Paris.{{cite book}}: CS1 maint: location missing publisher (link)

Abstract family of acceptors (1,306 words) [view diff] exact match in snippet view article find links to article

theory paper at the IEEE Eighth Annual Symposium on Switching and Automata Theory in 1967. Seymour Ginsburg, Algebraic and automata theoretic properties

Igor Aleksander (687 words) [view diff] case mismatch in snippet view article find links to article

College Press ISBN 1-86094-036-6. 1975, I.Aleksander, F. Keith Hanna, Automata Theory: An Engineering Approach New York: Crane Russak, London: Edward Arnold

Satoru Miyano (334 words) [view diff] exact match in snippet view article find links to article

University. In 1985 he also received his PhD with hierarchy theorems in automata theory. In 1987 Miyano became an associate professor at the Faculty of Science

P (complexity) (1,789 words) [view diff] exact match in snippet view article

John E.; Rajeev Motwani; Jeffrey D. Ullman (2001). Introduction to automata theory, languages, and computation (2. ed.). Boston: Addison-Wesley. pp. 425–426

Higher-dimensional algebra (1,511 words) [view diff] case mismatch in snippet view article find links to article

Appliquées. 19: 388–391. Baianu, I.C. (1987). "Computer Models and Automata Theory in Biology and Medicine". In M. Witten (ed.). Mathematical Models in

Nonelementary problem (458 words) [view diff] case mismatch in snippet view article find links to article

Stockmeyer, Larry J. (1974), The Complexity of Decision Problems in Automata Theory and Logic (PDF), Ph.D. dissertation, Massachusetts Institute of Technology

Alternation (formal language theory) (285 words) [view diff] case mismatch in snippet view article

ISBN 9780080916613. John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing, Reading Massachusetts

Co-NP (851 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-0-521-42426-4. Hopcroft, John E. (2000). Introduction to Automata Theory, Languages, and Computation (2nd ed.). Boston: Addison-Wesley. ISBN 0-201-44124-1

Splicing rule (388 words) [view diff] exact match in snippet view article find links to article

Anderson (2006) p. 240 Anderson (2006) p. 241 Anderson, James A. (2006). Automata theory with modern applications. With contributions by Tom Head. Cambridge:

Levi's lemma (642 words) [view diff] exact match in snippet view article find links to article

ISBN 978-0-521-59924-5. Sakarovitch, Jacques (2009), Elements of automata theory, Translated from the French by Reuben Thomas, Cambridge: Cambridge

Programming language theory (1,616 words) [view diff] case mismatch in snippet view article find links to article

Gross (1996). Introduction to the CUCH. In E. R. Caianiello (ed.), Automata Theory, p. 35-64/ Benjamin C. Pierce. 2002. Types and Programming Languages

Mealy machine (927 words) [view diff] exact match in snippet view article find links to article

Technical Journal. pp. 1045–1079. Holcombe, W.M.L. (1982). Algebraic automata theory. Cambridge Studies in Advanced Mathematics. Vol. 1. Cambridge University

Nilsemigroup (427 words) [view diff] case mismatch in snippet view article find links to article

}=yx^{\omega }} . Pin, Jean-Éric (2018-06-15). Mathematical Foundations of Automata Theory (PDF). p. 198. Grillet, P A (1995). Semigroups. CRC Press. p. 110.

Double pushout graph rewriting (637 words) [view diff] case mismatch in snippet view article find links to article

IEEE Conference Record of 14th Annual Symposium on Switching and Automata Theory (SWAT'08). IEEE. pp. 167–180. doi:10.1109/SWAT.1973.11. Hartmut Ehrig;

Generalized star-height problem (361 words) [view diff] exact match in snippet view article find links to article

1016/0890-5401(92)90063-L. Sakarovitch, Jacques (2009). Elements of automata theory. Translated from the French by Reuben Thomas. Cambridge: Cambridge

Javier Esparza (798 words) [view diff] exact match in snippet view article find links to article

aforementioned fields, as well as a book on an algorithmic approach to automata theory (coauthored with Michael Blondin.) Multiple software verification tools

Unary numeral system (1,220 words) [view diff] case mismatch in snippet view article find links to article

146–156. Hopcroft, John E.; Ullman, Jeffrey D. (1979), Introduction to Automata Theory, Languages, and Computation, Addison Wesley, Example 7.7, pp. 158–159

Alternating Turing machine (1,963 words) [view diff] case mismatch in snippet view article find links to article

Alternation, pp. 399–401. Bakhadyr Khoussainov; Anil Nerode (2012). Automata Theory and its Applications. Springer Science & Business Media. ISBN 978-1-4612-0171-7

Cylindrical algebraic decomposition (430 words) [view diff] case mismatch in snippet view article find links to article

closed fields by cylindrical algebraic decomposition, Second GI Conf. Automata Theory and Formal Languages, Springer LNCS 33, 1975. Davenport, James H.;

E. W. Beth Dissertation Prize (136 words) [view diff] exact match in snippet view article find links to article

Dortmund 2015 Michał Skrzypczak Descriptive set theoretic methods in automata theory Uniwersytet Warszawski 2014 Thomas Graf Local and Transderivational

Second-order cellular automaton (725 words) [view diff] no match in snippet view article find links to article

Physica D was reprinted as Gutowitz, Howard, ed. (1991), Cellular Automata: Theory and Experiment, MIT/North-Holland. Chai, Zhenchuan; Cao, Zhenfu; Zhou

Semigroup (4,673 words) [view diff] exact match in snippet view article find links to article

semigroups, as well as monographs focusing on applications in algebraic automata theory, particularly for finite automata, and also in functional analysis

Road coloring theorem (676 words) [view diff] exact match in snippet view article find links to article

relation between this notion and that of a synchronizing word in finite automata theory. For such a coloring to exist at all, it is necessary that G be aperiodic

Albert R. Meyer (392 words) [view diff] case mismatch in snippet view article find links to article

requires exponential space". Proc. 13th Annual Symposium on Switching and Automata Theory. pp. 125–129. doi:10.1109/SWAT.1972.29.. Albert Ronald da Silva Meyer

Top-down parsing language (922 words) [view diff] case mismatch in snippet view article find links to article

SWAT '70: Proceedings of the 11th Annual Symposium on Switching and Automata Theory: 153–174. doi:10.1109/SWAT.1970.18. Birman, Alexander; Ullman, Jeffrey

Cyclic cellular automaton (1,224 words) [view diff] no match in snippet view article find links to article

1016/0167-2789(90)90170-T. Reprinted in Gutowitz, Howard A., ed. (1991). Cellular Automata: Theory and Experiment. MIT Press/North-Holland. pp. 19–25. ISBN 0-262-57086-6

Samvel K. Shoukourian (276 words) [view diff] case mismatch in snippet view article find links to article

Carlos; Dediu, Adrian Horia; Fernau, Henning (2010-05-10). Language and Automata Theory and Applications: 4th International Conference, LATA 2010, Trier, Germany

In silico medicine (1,101 words) [view diff] no match in snippet view article find links to article

The term in silico was first used in 1989 at a workshop "Cellular Automata: Theory and Applications" by a mathematician from National Autonomous University

Greibach's theorem (852 words) [view diff] case mismatch in snippet view article find links to article

S2CID 19948229. John E. Hopcroft; Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 0-201-02988-X. p

Alvy Ray Smith (1,467 words) [view diff] exact match in snippet view article find links to article

science from Stanford University, with a dissertation on cellular automata theory jointly supervised by Michael A. Arbib, Edward J. McCluskey, and Bernard

George E. Collins (241 words) [view diff] case mismatch in snippet view article find links to article

elementary theory of real closed fields by cylindrical algebraic decomposition, Second GI Conf. Automata Theory and Formal Languages, Springer LNCS 33, 1975.

Graph drawing (3,269 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-3-540-00881-1. Anderson, James Andrew; Head, Thomas J. (2006), Automata Theory with Modern Applications, Cambridge University Press, pp. 38–41,

L/poly (443 words) [view diff] case mismatch in snippet view article find links to article

squares", Proceedings of the 7th Annual IEEE Symposium on Switching and Automata Theory (SWAT 1966), pp. 78–87, doi:10.1109/SWAT.1966.30. Aleliunas, Romas;

Jarkko Kari (589 words) [view diff] no match in snippet view article find links to article

"Reversibility of 2D cellular automata is undecidable", Cellular automata: theory and experiment (Los Alamos, NM, 1989), Physica D: Nonlinear Phenomena

Ukkonen's algorithm (1,056 words) [view diff] case mismatch in snippet view article find links to article

matching algorithms" (PDF). 14th Annual Symposium on Switching and Automata Theory (SWAT 1973). pp. 1–11. CiteSeerX 10.1.1.474.9582. doi:10.1109/SWAT

Transitive closure (2,306 words) [view diff] case mismatch in snippet view article find links to article

and John E. Hopcroft (ed.). Proc. 12th Ann. Symp. on Switching and Automata Theory (SWAT). IEEE Computer Society. pp. 129–131. doi:10.1109/SWAT.1971.4

Gauss notation (458 words) [view diff] case mismatch in snippet view article find links to article

Horia; Ionescu, Armand Mihai; Martín-Vide, Carlos (eds.). Language and Automata Theory and Applications. Lecture Notes in Computer Science. Vol. 5457. Berlin

Polynomial hierarchy (2,690 words) [view diff] case mismatch in snippet view article find links to article

Space. In Proceedings of the 13th IEEE Symposium on Switching and Automata Theory, pp. 125–129, 1972. The paper that introduced the polynomial hierarchy

Glob (programming) (1,838 words) [view diff] case mismatch in snippet view article

John E.; Motwani, Rajeev; Ullman, Jeffrey D. (2000). Introduction to Automata Theory, Languages, and Computation (2nd ed.). Addison-Wesley. "Lib/fnmatch

Kleene's algorithm (998 words) [view diff] case mismatch in snippet view article find links to article

37-40 John E. Hopcroft, Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 0-201-02988-X. Here:

Evolutionary computation (2,960 words) [view diff] case mismatch in snippet view article find links to article

Hopcroft, J.E., R. Motwani, and J.D. Ullman (2001) Introduction to Automata Theory, Languages, and Computation, Addison Wesley, Boston/San Francisco/New

Earley parser (1,997 words) [view diff] case mismatch in snippet view article find links to article

2004-07-08 John E. Hopcroft and Jeffrey D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Reading/MA: Addison-Wesley. ISBN 978-0-201-02988-8

CYK algorithm (2,179 words) [view diff] case mismatch in snippet view article find links to article

NYU. Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation. Reading/MA: Addison-Wesley. ISBN 0-201-02988-X

Sorting network (2,159 words) [view diff] case mismatch in snippet view article find links to article

D.; Závodný, J. (2014). "Optimal Sorting Networks". Language and Automata Theory and Applications. Lecture Notes in Computer Science. Vol. 8370. pp

John Horton Conway (3,386 words) [view diff] exact match in snippet view article find links to article

to the theory of knots, to mathematical logic (both set theory and automata theory) and to the theory of games (as also to its practice). In 2017 Conway

King's graph (647 words) [view diff] case mismatch in snippet view article find links to article

recognition by cellular automata", 12th Annual Symposium on Switching and Automata Theory, pp. 144–152, doi:10.1109/SWAT.1971.29. Chepoi, Victor; Dragan, Feodor;

Coordination sequence (515 words) [view diff] exact match in snippet view article find links to article

(2022), "Coordination sequences of periodic structures are rational via automata theory", Acta Crystallogr., A78 (2): 155–157, arXiv:2307.15803, doi:10

Point-set triangulation (1,156 words) [view diff] case mismatch in snippet view article find links to article

Annual Symposium on Foundations of Computer Science. Switching and Automata Theory, 1974., IEEE Conference Record of 15th Annual Symposium on. pp. 228–240

Ogden's lemma (1,819 words) [view diff] exact match in snippet view article find links to article

Retrieved 16 May 2024. Hopcroft, John E. (1979). Introduction to automata theory, languages, and computation. Jeffrey D. Ullman. Reading, Mass.: Addison-Wesley

Harold V. McIntosh (699 words) [view diff] no match in snippet view article find links to article

Howard (ed.), "Wolfram's class IV automata and a good Life", Cellular automata: theory and experiment, proceedings of the workshop held in Los Alamos, New

Suffix tree (3,691 words) [view diff] case mismatch in snippet view article find links to article

matching algorithms" (PDF), 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 1–11, doi:10.1109/SWAT.1973.13, archived from the original (PDF)

Time complexity (5,004 words) [view diff] case mismatch in snippet view article find links to article

fields by cylindrical algebraic decomposition". In Brakhage, H. (ed.). Automata Theory and Formal Languages: 2nd GI Conference, Kaiserslautern, May 20–23

Quantum finite automaton (3,633 words) [view diff] case mismatch in snippet view article find links to article

Mathematical Biophysics, 33 pp.339-354. I. Baianu, "Categories, Functors and Quantum Automata Theory" (1971). The 4th Intl. Congress LMPS, August-Sept.1971

Quantum finite automaton (3,633 words) [view diff] case mismatch in snippet view article find links to article

Mathematical Biophysics, 33 pp.339-354. I. Baianu, "Categories, Functors and Quantum Automata Theory" (1971). The 4th Intl. Congress LMPS, August-Sept.1971

String operations (2,319 words) [view diff] case mismatch in snippet view article find links to article

substitutions. Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages and Computation. Reading, Massachusetts: Addison-Wesley

Probabilistic automaton (1,726 words) [view diff] no match in snippet view article find links to article

Automata". arXiv:2103.14423 [cs.FL]. Salomaa, Arto (1969). "Finite nondeterministic and probabilistic automata". Theory of Automata. Oxford: Pergamon Press.

ILabs (1,311 words) [view diff] exact match in snippet view article find links to article

developed with Francesco Berto and Jacopo Tagliabue – use cellular automata theory as the building block of computation and a perfect isomorphism between

Juris Hartmanis (2,502 words) [view diff] exact match in snippet view article find links to article

article gives a personal account of developments in this area and in automata theory and discusses the underlying beliefs and philosophy that guided his

Gad Landau (1,250 words) [view diff] case mismatch in snippet view article find links to article

conferences, most recently, International Conference on Language and Automata Theory and Applications (LATA), International Symposium on String Processing

Profinite word (1,044 words) [view diff] case mismatch in snippet view article find links to article

languages. Pin, Jean-Éric (2016-11-30). Mathematical Foundations of Automata Theory (PDF). pp. 130–139. Almeida, Jorge (1994). Finite semigroups and universal

Prague City University (1,203 words) [view diff] exact match in snippet view article find links to article

history of cryptography; links between mathematics and art; cellular automata theory and applications; pattern theory and design; quality assurance and

Separating words problem (890 words) [view diff] case mismatch in snippet view article find links to article

arXiv:2007.12097 [math.CO]. Shallit, Jeffrey (2014), "Open Problems in Automata Theory: An Idiosyncratic View", British Colloquium for Theoretical Computer

Lee (1961) John Hopcroft, Jeffrey Ullman (1979). Introduction to Automata Theory, Languages and Computation, 1st ed., Reading Mass: Addison-Wesley.

Random-access stored-program machine (2,620 words) [view diff] case mismatch in snippet view article find links to article

pp. 232–245. John Hopcroft, Jeffrey Ullman (1979). Introduction to Automata Theory, Languages and Computation, 1st ed., Reading Mass: Addison-Wesley.

Peter G. Ossorio (1,205 words) [view diff] exact match in snippet view article find links to article

department</interview with P. G. Ossorio>. He also became familiar with automata theory and was a proficient computer programmer. At UCLA, he worked closely

Variety of finite semigroups (1,500 words) [view diff] case mismatch in snippet view article find links to article

product. Pin, Jean-Éric (2016-11-30). Mathematical Foundations of Automata Theory (PDF). pp. 141–160. Pin, Jean-Éric (1986). Varieties of formal language

Union theorem (290 words) [view diff] case mismatch in snippet view article find links to article

ISBN 9781450374781. Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation (1st ed.). Addison-Wesley. ISBN 0-201-02988-X

Harvard Laboratory for Computer Graphics and Spatial Analysis (1,785 words) [view diff] exact match in snippet view article find links to article

collaboration with Nick Chrisman and Jim Dougenik, which was based on automata theory and dynamic scoping. GLIB/LINGUIST provided an English-like user interface

Markov decision process (4,869 words) [view diff] exact match in snippet view article find links to article

learning scheme with a rigorous proof of convergence. In learning automata theory, a stochastic automaton consists of: a set x of possible inputs, a

Turing machine equivalents (2,667 words) [view diff] case mismatch in snippet view article find links to article

automaton John Hopcroft and Jeffrey Ullman (1979). Introduction to Automata Theory, Languages and Computation (1st ed.). Addison–Wesley, Reading Mass

Adaptive grammar (1,921 words) [view diff] exact match in snippet view article find links to article

machine he called a structured pushdown automaton, the core of adaptive automata theory as pursued by Iwai, Pistori, Bravo and others. This formalism allows

Counter machine (4,601 words) [view diff] case mismatch in snippet view article find links to article

pp. 232–245. Hopcroft, John; Jeffrey Ullman (1979). Introduction to Automata Theory, Languages and Computation (1st ed.). Reading Mass: Addison-Wesley

Anatoly Shalyto (2,062 words) [view diff] case mismatch in snippet view article find links to article

/ Proceedings of the 9th International Conference on Language and Automata Theory and Applications (LATA-2015). 2015, pp. 611–622. Chivilikhin D., Shalyto

Rule 90 (3,293 words) [view diff] exact match in snippet view article find links to article

Chaudhuri, P. Pal (1993), "On explicit expressions in additive cellular automata theory", Information Sciences, 72 (1–2): 83–103, doi:10.1016/0020-0255(93)90030-P

Semigroup with three elements (496 words) [view diff] case mismatch in snippet view article find links to article

"This innocuous three-element semigroup plays an important role in what follows..." – Applications of Automata Theory and Algebra by John L. Rhodes.

Self-replicating machine (5,205 words) [view diff] exact match in snippet view article find links to article

of Scientific American. Von Neumann's goal for his self-reproducing automata theory, as specified in his lectures at the University of Illinois in 1949

Hermann Moisl (1,494 words) [view diff] exact match in snippet view article find links to article

sequential architecture was originally stated in terms of standard automata theory as a system of cooperating finite state automata, but more recently

Markov chain (13,271 words) [view diff] case mismatch in snippet view article find links to article

Tweedie. online: CTCN Booth, Taylor L. (1967). Sequential Machines and Automata Theory (1st ed.). New York, NY: John Wiley and Sons, Inc. Library of Congress

Semigroup with involution (3,600 words) [view diff] case mismatch in snippet view article find links to article

pp. 13–14. ISBN 978-981-02-4042-4. Jacques Sakarovitch. Elements of Automata Theory. Cambridge University Press. pp. 305–306. Stephen Lipscomb (1996).

Hopcroft–Karp algorithm (3,746 words) [view diff] case mismatch in snippet view article find links to article

Previously announced at the 12th Annual Symposium on Switching and Automata Theory, 1971. Karzanov, A. V. (1973), "An exact estimate of an algorithm for

Stanisław Ulam (8,015 words) [view diff] exact match in snippet view article find links to article

theoretical biology are considered watersheds in the development of cellular automata theory, population biology, pattern recognition, and biometrics generally

Busy beaver (5,884 words) [view diff] case mismatch in snippet view article find links to article

With 19 references. Booth, Taylor L. (1967). Sequential Machines and Automata Theory. New York: Wiley. ISBN 978-0-471-08848-6. Cf Chapter 9, Turing Machines

Probabilistic context-free grammar (5,256 words) [view diff] case mismatch in snippet view article find links to article

Addison-Wesley. Hopcroft J. E.; Ullman J. D. (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. Giegerich R. (2000). "Explaining

Travelling salesman problem (11,464 words) [view diff] case mismatch in snippet view article find links to article

traveling salesperson problem. 15th Annual Symposium on Switching and Automata Theory (swat 1974). doi:10.1109/SWAT.1974.4. Ray, S. S.; Bandyopadhyay, S

Random-access machine (7,514 words) [view diff] case mismatch in snippet view article find links to article

pp. 232–245. John Hopcroft, Jeffrey Ullman (1979). Introduction to Automata Theory, Languages and Computation, 1st ed., Reading Mass: Addison-Wesley.

Carl Friedrich Gauss (19,719 words) [view diff] case mismatch in snippet view article find links to article

Horia; Ionescu, Armand Mihai; Martín-Vide, Carlos (eds.). Language and Automata Theory and Applications. Lecture Notes in Computer Science. Vol. 5457. Berlin

Special classes of semigroups (428 words) [view diff] case mismatch in snippet view article find links to article

[Pin] Pin, Jean-Éric (2016-11-30). Mathematical Foundations of Automata Theory (PDF). [Fennemore] Fennemore, Charles (1970), "All varieties of bands"

Anatoly Karatsuba (9,409 words) [view diff] exact match in snippet view article find links to article

problems set up by Kolmogorov. This was essential for the development of automata theory and started a new branch in Mathematics, the theory of fast algorithms

History of compiler construction (6,356 words) [view diff] case mismatch in snippet view article find links to article

transduction," focs, pp.21–35, 7th Annual Symposium on Switching and Automata Theory (SWAT 1966), 1966 Lewis, P. and Stearns, R. "Syntax-Directed Transduction"

Karnaugh map (3,574 words) [view diff] case mismatch in snippet view article find links to article

CRC Press. Kohavi, Zvi; Jha, Niraj K. (2009). Switching and Finite Automata Theory (3 ed.). Cambridge University Press. ISBN 978-0-521-85748-2. Grund

Formal power series (9,656 words) [view diff] exact match in snippet view article find links to article

Semirings and formal power series: Their relevance to formal languages and automata theory. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages

Semiring (8,054 words) [view diff] exact match in snippet view article find links to article

CS1 maint: location (link) Sakarovitch, Jacques (2009). Elements of automata theory. Translated from the French by Reuben Thomas. Cambridge: Cambridge

Existential theory of the reals (3,763 words) [view diff] exact match in snippet view article find links to article

elimination for real closed fields by cylindrical algebraic decomposition", Automata theory and formal languages (Second GI Conf., Kaiserslautern, 1975), Lecture

List of important publications in computer science (5,931 words) [view diff] case mismatch in snippet view article find links to article

Conference Record of the 1969 Tenth Annual Symposium on Switching and Automata Theory. pp. 74–81. Contains the first presentation of stochastic context-free

Logic optimization (1,660 words) [view diff] case mismatch in snippet view article find links to article

Kohavi, Zvi; Jha, Niraj K. (2009). "4–6". Switching and Finite Automata Theory (3rd ed.). Cambridge University Press. ISBN 978-0-521-85748-2. Rutenbar

Quantum dot cellular automaton (3,242 words) [view diff] case mismatch in snippet view article find links to article

Quantum Automaton: Baianu, I. 1971a. "Categories, Functors and Quantum Automata Theory". The 4th Intl. Congress LMPS, August-Sept.1971; Baianu, I.1971b. "Organismic

LR parser (8,128 words) [view diff] case mismatch in snippet view article find links to article

1971. Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN 0-201-02988-X. Here:

Syntactic parsing (computational linguistics) (2,829 words) [view diff] case mismatch in snippet view article

representation of formal languages. 10th Annual Symposium on Switching and Automata Theory. Chen, Danqi; Narasimhan, Karthik (2019). "Constituency Parsing" (PDF)

Alignment-free sequence analysis (6,323 words) [view diff] case mismatch in snippet view article find links to article

pattern matching algorithms". 14th Annual Symposium on Switching and Automata Theory (swat 1973). pp. 1–11. CiteSeerX 10.1.1.474.9582. doi:10.1109/SWAT