Consensual languages and matching finite-state computations
RAIRO-Theor. Inf. Appl., 45 1 (2011) 77-97
Published online: 2011-03-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
From Regular to Strictly Locally Testable Languages
Stefano Crespi Reghizzi and Pierluigi San PietroElectronic Proceedings in Theoretical Computer Science 63 103 (2011)
DOI: 10.4204/EPTCS.63.14
See this article
Implementation and Application of Automata
Stefano Crespi Reghizzi and Pierluigi San PietroLecture Notes in Computer Science, Implementation and Application of Automata 7982 280 (2013)
DOI: 10.1007/978-3-642-39274-0_25
See this article
FROM REGULAR TO STRICTLY LOCALLY TESTABLE LANGUAGES
STEFANO CRESPI REGHIZZI and PIERLUIGI SAN PIETROInternational Journal of Foundations of Computer Science 23 (08) 1711 (2012)
DOI: 10.1142/S0129054112400710
See this article
Commutative Languages and their Composition by Consensual Methods
Stefano Crespi Reghizzi and Pierluigi San PietroElectronic Proceedings in Theoretical Computer Science 151 216 (2014)
DOI: 10.4204/EPTCS.151.15
See this article
Counter machines, Petri Nets, and consensual computation
Stefano Crespi Reghizzi and Pierluigi San PietroTheoretical Computer Science 664 91 (2017)
DOI: 10.1016/j.tcs.2015.12.004
See this article
Implementation and Application of Automata
Stefano Crespi Reghizzi and Pierluigi L. San PietroLecture Notes in Computer Science, Implementation and Application of Automata 7381 113 (2012)
DOI: 10.1007/978-3-642-31606-7_10
See this article