Methods and systems for representing processing resources

1. A tangible, non-transitory machine readable medium, comprising:

a markup language to describe the composition of automata networks, wherein the language uses elements that represent automata processing resources, wherein each element of the elements represents at least one of a state transition element, a counter element, and a Boolean element as the automata processing resources, wherein an element of the elements represents the state transition element and comprises each of an identification attribute comprising a unique identifier of the state transition element and a symbol set attribute defining one or more symbols the state transition element is programmed to match, wherein the markup language is utilized to generate a binary file used to program at least a portion of an automata processor, wherein the language uses at least one container element that represents automata processing resources, wherein the at least one container element comprises an automata network element as a top-level root element comprising a complete design of an automata network.

2. The tangible, non-transitory machine readable medium of claim 1 , wherein the element that represents the state transition element comprises a start attribute.

3. The tangible, non-transitory machine readable medium of claim 1 , wherein the element that represents the state transition element comprises a case attribute.

4. The tangible, non-transitory machine readable medium of claim 1 , wherein the element that represents the state transition element comprises a latch attribute.

5. The tangible, non-transitory machine readable medium of claim 1 , wherein the element that represents the state transition element comprises a report-on-match output element.

6. The tangible, non-transitory machine readable medium of claim 1 , wherein the element that represents the state transition element comprises an activate-on-match output element.

7. The tangible, non-transitory machine readable medium of claim 1 , wherein a second element of the elements that represents the counter element comprises each of an identification attribute and a target attribute.

8. The tangible, non-transitory machine readable medium of claim 1 , wherein a second element of the elements that represents the counter element comprises an at target attribute.

9. The tangible, non-transitory machine readable medium of claim 1 , wherein a second element of the elements that represents the counter element comprises a report-on-match output element.

10. The tangible, non-transitory machine readable medium of claim 1 , wherein a second element of the elements that represents the counter element comprises an activate-on-match output element.

11. The tangible, non-transitory machine readable medium of claim 1 , wherein a second element of the elements that represents the counter element comprises a count input terminal.

12. The tangible, non-transitory machine readable medium of claim 1 , wherein a second element of the elements that represents the counter element comprises a reset input terminal.

13. The tangible, non-transitory machine readable medium of claim 1 , wherein a second element of the elements that represents the Boolean element comprises a single input terminal accepting a single activation signal, single input terminals accepting multiple activation signals, and multiple input terminals accepting multiple activation signals.

14. The tangible, non-transitory machine readable medium of claim 13 , wherein the second element that represents the Boolean element comprising a single input terminal accepting a single activation signal comprises an inverter.

15. The tangible, non-transitory machine readable medium of claim 13 , wherein the second element that represents the Boolean element comprising single input terminals accepting multiple activation signals comprises at least one of an OR element, an AND element, a NAND element, and a NOR element.

16. The tangible, non-transitory machine readable medium of claim 13 , wherein the second element that represents the Boolean element comprising multiple input terminals accepting multiple activation signals comprises at least one of a sum-of-product (SOP) element, a product-of-sums (POS) element, a nsum-of-products (NSOP) element, and a nproduct-of-sums (NPOS) element.

17. The tangible, non-transitory machine readable medium of claim 1 , wherein a second element of the elements that represents the Boolean element comprises an identification attribute.

18. The tangible, non-transitory machine readable medium of claim 1 , wherein a second element of the elements that represents the Boolean element comprises an end of data (EOD) attribute.

19. The tangible, non-transitory machine readable medium of claim 1 , wherein a second element of the elements that represents the Boolean element comprises a report-on-match output element.

20. The tangible, non-transitory machine readable medium of claim 1 , wherein a second element of the elements that represents the Boolean element comprises an activate-on-match output element.

21. The tangible, non-transitory machine readable medium of claim 1 , wherein the automata network element comprises at least one of a foundational element or a macro element.

22. The tangible, non-transitory machine readable medium of claim 21 , wherein the at least one foundational element represents at least one of the state transition element, the counter element, and the Boolean element.

23. The tangible, non-transitory machine readable medium of claim 1 , wherein a second at least one container element comprises a macro element.

24. The tangible, non-transitory machine readable medium of claim 23 , wherein the macro element comprises each of a header attribute and a body attribute.

25. The tangible, non-transitory machine readable medium of claim 23 , wherein the macro element comprises a description.

26. The tangible, non-transitory machine readable medium of claim 23 , wherein the macro element comprises port declarations.

27. The tangible, non-transitory machine readable medium of claim 23 , wherein the macro element comprises parameter declarations.

28. A tangible, non-transitory machine readable medium comprising a markup language comprising instructions to:

use elements to represent automata processing resources of an automata processor, wherein an element of the elements represents a state transition element and comprises each of an identification attribute comprising a unique identifier of the state transition element and a symbol set attribute defining one or more symbols the state transition element is programmed to match;

use at least one container element to represent automata processing resources, wherein the at least one container element comprises an automata network element as a top-level root element comprising a complete design of an automata network; and

transmit the elements and the at least one container element to a compiler to be directly compiled into a loadable binary object.

29. The machine readable medium of claim 28 , wherein the loadable binary object is read by at least a portion of the automata processor.

30. A tangible, non-transitory machine readable medium comprising an automaton construction language comprising instructions to:

implement features that extend automata designs through special purpose elements of an automata processor, wherein elements that represent the special purpose elements of the automata processor each comprise an identification attribute comprising a unique identifier of a respective special purpose element of the special purpose elements; and

represent an automata network comprising at least one special purpose element of the special purpose elements of the automata processor via an automata network element as a top-level root element comprising a complete design of the automata network.

31. The machine readable medium of claim 30 , wherein the instructions extend automata designs through a programmable quantification cell as a special purpose element of the special purpose elements.

32. The machine readable medium of claim 30 , wherein the instructions extend automata designs through a programmable Boolean cell as a special purpose element of the special purpose elements.