scientific article; zbMATH DE number 3870628

MaRDI QIDQ3336723zbMATH OpenFDO

Authors Wojciech Rytter

Publication date 1984

zbMATH Keywords

complexitymembership problemtrace languagesnondeterministic multihead automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3848633
• Publication:4508302
• On regular trace languages
• Subclasses of recognizable trace languages
• scientific article; zbMATH DE number 176495
• scientific article; zbMATH DE number 176133
• The generalized rank of trace languages
• The generalized rank of trace languages
• scientific article; zbMATH DE number 4058887

Cited in

(12)

• Number of prefixes in trace monoids: clique polynomials and dependency graphs
• On bounded rational trace languages
• Efficient recognition of trace languages defined by repeat-until loops
• Theory of traces
• Membership problems for regular and context-free trace languages
• Probabilistic estimation of the number of prefixes of a trace
• Linear automata with translucent letters and linear context-free trace languages
• Subclasses of recognizable trace languages
• scientific article; zbMATH DE number 1916672 (Why is no real title available?)
• On the decidability of some problems about rational subsets of free partially commutative monoids
• scientific article; zbMATH DE number 3848633 (Why is no real title available?)
• scientific article; zbMATH DE number 3874641 (Why is no real title available?)

This page was built for publication:

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