The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy

DOI10.1007/978-3-319-34171-2_17zbMath1386.20037arXiv1509.05364OpenAlexW2963477084MaRDI QIDQ5740189

Manfred Kufleitner, Jan Philipp Wächter

Publication date: 25 July 2016

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.05364

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40)

Related Items

The \(\kappa\)-word problem over \(\mathsf{DRH}\)

Cites Work

• The word problem for \(\omega \)-terms over DA
• On the lattice of sub-pseudovarieties of DA.
• An automata-theoretic approach to the word problem for \(\omega\)-terms over R
• The lattice of pseudovarieties of idempotent semigroups and a non-regular analogue
• On radical congruence systems
• Separating Regular Languages by Piecewise Testable and Unambiguous Languages
• On logical hierarchies within FO^2-definable languages
• The Join Levels of the Trotter-Weil Hierarchy Are Decidable
• Ehrenfeucht-Fraisse Games on Omega-Terms
• Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
• Varieties of Bands Revisited
• NORMAL FORMS FOR FREE APERIODIC SEMIGROUPS
• On finite monoids having only trivial subgroups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item