Characterizations of the decidability of some problems for regular trace languages
From MaRDI portal
Publication:4729376
DOI10.1007/BF02088289zbMath0679.68132WikidataQ57402290 ScholiaQ57402290MaRDI QIDQ4729376
Hendrik Jan Hoogeboom, Ijsbrand Jan Aalbersberg
Publication date: 1989
Published in: Mathematical Systems Theory (Search for Journal in Brave)
68Q45: Formal languages and automata
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
Logical definability of some rational trace languages, On some decision problems for trace codings, Probabilistic estimation of the number of prefixes of a trace, Rational relations and rational series, The code problem for traces -- improving the boundaries, Solving word equations modulo partial commutations