Matching Machines

Matching Machines is an idea invented by User: A(). Basically, a MM does one of two things:

• If all a's match with all b's, halt
• If not all a's match with all b's, or not all b's match with all a's; loop forever

note: a's go before b's

Examples

ab

halts.

ba

loops.

ababab

halts.

abbabba

loops. a and b could be any chars, like (,) ; [,] ; etc..

Interpreters

Remove n' Check

Remove '()': 2
Check ' ': 7
Check '(': 6
Check ')': 6
Check ')(': 6
Return 'invalid': 6
Return 'valid': 8

Notes

Matching Machines are obviously not Turing Complete