Efficient recognition of trace languages defined by repeat-until loops

DOI10.1016/J.IC.2010.03.001MaRDI QIDQ989291zbMATH OpenOpenAlexFDO

Authors Luca Breveglieri, Stefano Crespi Reghizzi, Massimiliano Goldwurm

Publication date 19 August 2010

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2434/55043

zbMATH Keywords

automata and formal languagesinteger compositionstrace languagesdependencies checkinglocal finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Membership problems for regular and context-free trace languages
• scientific article; zbMATH DE number 1333602
• scientific article; zbMATH DE number 4058887
• Recognizable trace languages, distributed automata and the distribution problem
• scientific article; zbMATH DE number 17820

Cites work

• scientific article; zbMATH DE number 3870628 (Why is no real title available?)
• scientific article; zbMATH DE number 1097351 (Why is no real title available?)
• scientific article; zbMATH DE number 2155520 (Why is no real title available?)
• Local languages and the Berry-Sethi algorithm
• Membership problems for regular and context-free trace languages
• On regular trace languages
• Regular right part grammars and their parsers

Cited in

(2)

• Number of prefixes in trace monoids: clique polynomials and dependency graphs
• Traces of Control-Flow Graphs

This page was built for publication: Efficient recognition of trace languages defined by repeat-until loops

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