Efficient recognition of trace languages defined by repeat-until loops

DOI10.1016/J.IC.2010.03.001zbMATH Open1205.68195OpenAlexW2038000721MaRDI QIDQ989291FDOQ989291

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

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

zbMATH Keywords

automata and formal languagesinteger compositionstrace languagesdependencies checkinglocal finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Regular right part grammars and their parsers
• Membership problems for regular and context-free trace languages
• Title not available (Why is that?)
• Local languages and the Berry-Sethi algorithm
• On regular trace languages
• Title not available (Why is that?)
• Title not available (Why is that?)

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)