The following pages link to Robert McNaughton (Q211674):
Displaying 42 items.
- The undecidability of the preperfectness of Thue systems (Q797574) (← links)
- (Q1057262) (redirect page) (← links)
- An \(O(| T| ^ 3)\) algorithm for testing the Church-Rosser property of Thue systems (Q1057263) (← links)
- The Church-Rosser property and special Thue systems (Q1071759) (← links)
- Special monoids and special Thue systems (Q1089108) (← links)
- The Burnside problem for semigroups (Q1215588) (← links)
- Regularity-preserving relations (Q1236516) (← links)
- Contributions of Ronald V. Book to the theory of string-rewriting systems (Q1274982) (← links)
- The finiteness of finitely presented monoids (Q1275467) (← links)
- Infinite games played on finite graphs (Q1314640) (← links)
- On the measure of normal formulas (Q2546864) (← links)
- Scheduling with deadlines and loss functions (Q2768989) (← links)
- Playing infinite games in finite time. (Q2776609) (← links)
- THE DEVELOPMENT OF FORMAL LANGUAGE THEORY SINCE 1956 (Q3210901) (← links)
- (Q3311638) (← links)
- (Q3484371) (← links)
- Church-Rosser Thue systems and formal languages (Q3798271) (← links)
- (Q3848196) (← links)
- (Q4028905) (← links)
- (Q4246720) (← links)
- Computing the Order of a Locally Testable Automaton (Q4327417) (← links)
- Algebraic decision procedures for local testability (Q4773689) (← links)
- (Q4941161) (← links)
- The Theory of Automata, a Survey (Q5342738) (← links)
- A polynomial time algorithm for the local testability problem of deterministic finite automata (Q5375412) (← links)
- (Q5508273) (← links)
- (Q5508686) (← links)
- Undefinability of Addition from One Unary Operator (Q5519121) (← links)
- The loop complexity of pure-group events (Q5551181) (← links)
- Parenthesis Grammars (Q5553283) (← links)
- (Q5602936) (← links)
- Testing and generating infinite sequences by a finite automaton (Q5613960) (← links)
- (Q5641083) (← links)
- (Q5672212) (← links)
- (Q5725999) (← links)
- A theorem about infinite-valued sentential logic (Q5804993) (← links)
- (Q5817533) (← links)
- Some formal relative consistency proofs (Q5823278) (← links)
- A Non-Standard Truth Definition (Q5827963) (← links)
- Complete Decoding Nets: General Theory and Minimality (Q5832372) (← links)
- Semi-Thue systems with an inhibitor (Q5947359) (← links)
- An efficient algorithm for local testability problem of finite state automata (Q6085759) (← links)
