Efficient recognition of trace languages defined by repeat-until loops

DOI10.1016/J.IC.2010.03.001zbMath1205.68195OpenAlexW2038000721MaRDI QIDQ989291

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)

Related Items (1)

Number of prefixes in trace monoids: clique polynomials and dependency graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local languages and the Berry-Sethi algorithm
• On regular trace languages
• Membership problems for regular and context-free trace languages
• Regular right part grammars and their parsers

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