Brenda S. Baker & Ronald V. Book (1974):
Reversal-bounded multipushdown machines.
Journal of Computer and System Sciences 8(3),
pp. 315 – 332,
doi:10.1016/S0022-0000(74)80027-9.
Stefano Crespi Reghizzi & Pierluigi San Pietro (2011):
Consensual languages and matching finite-state computations.
RAIRO - Theor. Inf. and Applic 45(1),
pp. 77–97,
doi:10.1051/ita/2011012.
Stefano Crespi-Reghizzi & Pierluigi San Pietro (2012):
Strict Local Testability with Consensus Equals Regularity.
In: Nelma Moreira & Rogério Reis: CIAA,
Lecture Notes in Computer Science 7381.
Springer,
pp. 113–124,
doi:10.1007/978-3-642-31606-7_10.
Stefano Crespi Reghizzi & Pierluigi San Pietro (2013):
Deterministic Counter Machines and Parallel Matching Computations.
In: Stavros Konstantinidis: Impl. and Appl. of Automata - 18th Int. Conf., CIAA 2013, Halifax, Nova Scotia, Canada, July 16-19, 2013.,
Lecture Notes in Computer Science 7982.
Springer,
pp. 280–291,
doi:10.1007/978-3-642-39274-0_25.
Seymour Ginsburgh (1966):
The mathematical theory of context-free languages.
McGraw-Hill.
Sheila A. Greibach (1976):
Remarks on the complexity of nondeterministic counter languages.
Theor. Comp. Sc. 1(4),
pp. 269–288,
doi:10.1016/0304-3975(76)90072-4.
Sheila A. Greibach (1978):
Remarks on Blind and Partially Blind One-Way Multicounter Machines.
Theor. Comput. Sci. 7,
pp. 311–324,
doi:10.1016/0304-3975(78)90020-8.
Oscar H. Ibarra (1978):
Reversal-Bounded Multicounter Machines and Their Decision Problems.
J. ACM 25(1),
pp. 116–133,
doi:10.1145/322047.322058.
Michel Latteux (1979):
Cônes rationnels commutatifs.
J. Comput. Syst. Sci. 18(3),
pp. 307–333,
doi:10.1016/0022-0000(79)90039-4.
Alexandru Mateescu (1994):
Scattered deletion and commutativity.
Theor. Comp. Sc. 125(2),
pp. 361–371,
doi:10.1016/0304-3975(94)90259-3.
Benedek Nagy (2009):
Languages Generated by Context-Free Grammars Extended by Type AB -> BA Rules.
Journal of Automata, Languages and Combinatorics 14(2),
pp. 175–186.
Benedek Nagy & Friedrich Otto (2012):
On CD-systems of stateless deterministic R-automata with window size one.
J. Comput. Syst. Sci 78(3),
pp. 780–806,
doi:10.1016/j.jcss.2011.12.009.
Michel Rigo (2003):
The commutative closure of a binary slip-language is context-free: a new proof.
Discrete Appl. Math. 131(3),
pp. 665–672,
doi:10.1016/S0166-218X(03)00335-4.
Arto Salomaa (1987):
Formal languages.
Academic Press,
San Diego, CA, USA.
Stefano Crespi Reghizzi & Pierluigi San Pietro (2013):
Commutative consensual counter languages..
Talk given at ICTCS 2013, 14th Italian Conference on Theoretical Computer Science, Palermo, Italia, Sept. 9-11, 2013..
Leslie G. Valiant (1990):
A bridging model for parallel computation.
Comm. ACM 33(8),
pp. 103,
doi:10.1145/79173.79181.
eptcs@eptcs.org