Search results
Jump to navigation
Jump to search
Page title matches
- | name = Introduction to Automata Theory, Languages, and Computation | image = Introduction to Automata Theory, Languages, and Computation.jpg ...7 KB (955 words) - 01:35, 29 November 2024
Page text matches
- #REDIRECT [[Introduction to Automata Theory, Languages, and Computation]] ...73 bytes (8 words) - 23:36, 22 January 2006
- #REDIRECT [[Introduction to Automata Theory, Languages, and Computation]] ...73 bytes (8 words) - 23:36, 22 January 2006
- In [[computer science]], a '''deterministic automaton''' is a concept of [[automata theory]] where the outcome of a transition from one [[State (computer scien | title=Automata theory with modern applications ...1 KB (154 words) - 18:38, 21 December 2023
- ...l games (cellular automaton)]], a discrete model of computation studied in automata theory ...560 bytes (61 words) - 03:12, 19 November 2024
- ...trent_0116404725818 |title=Introduction to Automata Theory, Languages, and Computation |edition=2nd |publisher=Addison-Wesley |location=Reading Mass |url-access=r [[Category:Automata (computation)]] ...2 KB (245 words) - 02:11, 19 June 2023
- | name = Introduction to Automata Theory, Languages, and Computation | image = Introduction to Automata Theory, Languages, and Computation.jpg ...7 KB (955 words) - 01:35, 29 November 2024
- In the [[theory of computation]], a '''generalized nondeterministic finite automaton''' ('''GNFA'''), also ...." In: 9th International [[Conference on Implementation and Application of Automata]], CIAA 2004, Kingston, Canada, July 22–24, 2004, Revised Selected Papers, ...3 KB (509 words) - 06:30, 14 April 2025
- In [[automata theory]], a '''hybrid automaton''' (plural: ''hybrid automata'' or ''hybrid automatons'') is a [[mathematical model]] for precisely descr ...s certain computations and turns the heater on and off. In general, hybrid automata have been used to model and analyze a variety of [[embedded systems]] inclu ...7 KB (922 words) - 16:07, 20 December 2024
- ...uter science]], a '''linear bounded automaton''' (plural '''linear bounded automata''', abbreviated '''LBA''') is a restricted form of [[Turing machine]]. instead of having potentially infinite tape on which to compute, computation is restricted to the portion of the tape containing the input plus the two ...7 KB (999 words) - 03:06, 29 November 2024
- ...he developed several key concepts and quantitative measures for [[cellular automata]] and suggested that critical points separating order from disorder could p ...value is close to 0.5. For a 2-state, [[Moore neighborhood]], 2D cellular automata, like [[Conways Life|Conway's Life]], the value is 0.273. ...7 KB (952 words) - 20:07, 18 March 2025
- ...tational complexity]] of an [[algorithm]] can be measured given a model of computation. Using a model allows studying the performance of algorithms independently Models of computation can be classified into three categories: sequential models, functional mode ...4 KB (489 words) - 21:54, 12 March 2025
- ...n | series=Research Monograph | volume=65 | year=1971 | title=Counter-free Automata | publisher=MIT Press | isbn=0-262-13076-9 | zbl=0232.94024 | url-access=re * {{cite book | last=Lawson | first=Mark V. | title=Finite automata | publisher=Chapman and Hall/CRC | year=2004 | isbn=1-58488-255-7 | zbl=108 ...5 KB (672 words) - 09:21, 9 March 2025
- In [[computation]], a [[finite-state machine]] (FSM) is '''event driven''' if the transition ...Ginr] is an industrial-strength compiler producing multitape finite state automata from rational patterns, functions and relations expressed in [[semiring]] a ...5 KB (622 words) - 07:23, 18 November 2024
- * [[Quantum cellular automata]], any one of several models of quantum computation ...1 KB (149 words) - 05:17, 12 January 2025
- *[[Automata theory]] *[[Theory of Computation]] ...2 KB (236 words) - 18:28, 23 December 2024
- ...fram|editor-link=Stephen Wolfram|title=Theory and Applications of Cellular Automata|series=Advanced series on complex systems|volume=1|publisher=World Scientif ...lows that they are all [[reversible cellular automaton|reversible cellular automata]], regardless of which function {{mvar|f}} is chosen to determine the autom ...6 KB (900 words) - 10:01, 18 October 2024
- ...rl=https://www.irif.fr/~jep//PDF/StarHeight.pdf |journal=[[Information and Computation]] |volume=101 |issue=2 |pages=219–250 |doi=10.1016/0890-5401(92)90063-L}} * {{cite book |last=Sakarovitch |first=Jacques |title=Elements of automata theory |others=Translated from the French by Reuben Thomas |location=Cambri ...3 KB (427 words) - 14:52, 12 December 2022
- ...hor = Michael Sipser | year = 1997 | title = Introduction to the Theory of Computation | publisher = PWS Publishing | isbn = 0-534-94728-X | page = [https://archi ...n |edition=3rd |title-link=Introduction to Automata Theory, Languages, and Computation |publisher=Addison-Wesley |year=2006 |isbn=0-321-45536-3 |pages=234,254}}</ ...10 KB (1,428 words) - 10:41, 4 June 2025
- ...er cells turn off. Thus, in the notation describing the family of cellular automata containing Life, it is described by the rule B2/S.<ref name="msz"/> ...n [[Cellular automaton#Classification|Wolfram's classification of cellular automata]], it is a Class III automaton, in which nearly all patterns evolve chaotic ...4 KB (613 words) - 08:38, 18 October 2024
- '''ICALP''', the '''International Colloquium on Automata, Languages, and Programming''' is an [[academic conference]] organized annu ...s, Preface, Conference Organization|title=47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)|series=Leibniz International Proce ...7 KB (878 words) - 11:21, 9 September 2024