Consensual Definition of Languages by Regular Sets

DOI10.1007/978-3-540-88282-4_19zbMATH Open1156.68452OpenAlexW1594902262MaRDI QIDQ3540109FDOQ3540109

Authors: Stefano Crespi Reghizzi, Pierluigi San Pietro 

Publication date: 20 November 2008

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_19

Recommendations

• Consensual languages and matching finite-state computations
• Strict local testability with consensus equals regularity
• Strict local testability with consensus equals regularity, and other properties
• Deterministic counter machines and parallel matching computations
• Consensus string problem for multiple regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• Strict local testability with consensus equals regularity
• Strict local testability with consensus equals regularity, and other properties
• Consensual languages and matching finite-state computations
• Counter machines, Petri nets, and consensual computation

This page was built for publication: Consensual Definition of Languages by Regular Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540109)