The “last” decision problem for rational trace languages (original) (raw)
Related papers
On recognizable languages in divisibility monoids
Lecture Notes in Computer Science, 1999
Theoretical Computer Science, 1987
On recognizable subsets of free partially commutative monoids
Theoretical Computer Science, 1988
Decidability of the Star Problem in A* x {b
Information Processing Letters, 1992
On some properties of the free monoids with applications to automata theory
Journal of Computer and System Sciences, 1967
Decidability of the Star Problem in
Information Processing Letters, 1992
Recognizable subsets of some partially abelian monoids
Theoretical Computer Science, 1985
Square-free words on partially commutative free monoids
Information Processing Letters, 1986
On the decidability of the word problem for amalgamated free products of inverse semigroups
Semigroup Forum, 2007
Decidability and independence of conjugacy problems in finitely presented monoids
Theoretical Computer Science
Which finite monoids are syntactic monoids of rational ω-languages
Information Processing Letters, 1992
Bi-interpretability of some monoids with the arithmetic and applications
Semigroup Forum, 2019
Rational languages and the Burnside problem
Theoretical Computer Science, 1985
Easy multiplications I. The realm of Kleene's theorem
Information and Computation, 1987
Lecture Notes in Computer Science, 1995
Membership problems for regular and context-free trace languages
Information and Computation, 1989
A characterization of automata and a direct product decomposition
Journal of Computer and System Sciences, 1976
On the inclusion problem for finitely ambiguous rational trace languages
RAIRO - Theoretical Informatics and Applications
Identifying regular languages over partially-commutative monoids
Lecture Notes in Computer Science, 1994
On the rational subset problem for groups
Journal of Algebra, 2007
Generalized rational relations and their logical definability
Fundamentals of Computation Theory, 1997
L(A) = L(B)? Decidability Results from Complete Formal Systems
Springer eBooks, 2002
Decidability Results from Complete Formal Systems
Theoretical Computer Science, 2001
On a Product of Finite Monoids
Semigroup Forum, 1998
Easy multiplications II. Extensions of rational semigroups
Information and Computation, 1990
Generalized Results on Monoids as Memory
Electronic Proceedings in Theoretical Computer Science, 2017
Inverse monoids: Decidability and complexity of algebraic questions
Information and Computation/information and Control, 2007
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation/information and Control, 2005
A construction on finite automata that has remained hidden
Theoretical Computer Science, 1998
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
RAIRO - Theoretical Informatics and Applications, 2008
Recognizable languages in concurrency monoids
Theoretical Computer Science, 1995
The identities of the free product of a pair of two-element monoids
Algebra universalis
Two problems on commutation of languages
2004
Semi-commutativity sets of morphisms over finitely generated free monoids
Bulletin mathématiques de la Société des sciences mathématiques de Roumanie
Detectability of labeled weighted automata over monoids
Discrete Event Dynamic Systems