The product of rational languages
From MaRDI portal
Publication:4630281
DOI10.1007/3-540-56939-1_92zbMath1422.68160MaRDI QIDQ4630281
Publication date: 29 March 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56939-1_92
68Q45: Formal languages and automata
68Q70: Algebraic theory of languages and automata
68-02: Research exposition (monographs, survey articles) pertaining to computer science
Related Items
Polynomial closure of group languages and open sets of the Hall topology, Polynomial closure and unambiguous product, Polynomial closure of group languages and open sets of the Hall topology, Algebraic tools for the concatenation product.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- Minimal noncommutative varieties and power varieties
- Power monoids and finite J-trivial monoids
- Pseudovarieties, generalized varieties and similarly described classes
- Improved limitedness theorems on finite automata with distance functions
- Factorization forests of finite height
- Limitedness theorem on finite automata with distance functions
- On M-varieties generated by power monoids
- Representation theorems on regular languages
- Characterizations of some classes of regular events
- First-order logic and star-free sets
- On the topological structure of a finitely generated semigroup of matrices
- Semigroups and languages of dot-depth two
- Partially ordered finite monoids and a theorem of I. Simon
- Algorithms for determining relative star height and star height
- Inverse monoids of dot-depth two
- A decision procedure for the order of regular events
- Recognizable sets and power sets of finite semigroups
- A generalization of the Schützenberger product of finite monoids
- The Birkhoff theorem for finite algebras
- Classifying regular events in symbolic logic
- On a conjecture concerning dot-depth two languages
- The dot-depth hierarchy of star-free languages is infinite
- On power varieties of semigroups
- Finite semigroup varieties of the form V*D
- Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
- Dot-depth of star-free events
- Characterizations of locally testable events
- Weak Second‐Order Arithmetic and Finite Automata
- An application of the Ehrenfeucht-Fraisse game in formal language theory
- Decision Problems of Finite Automata Design and Related Arithmetics
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Semigroupe des Parties et Relations de Green
- Algebraic decision procedures for local testability
- On finite monoids having only trivial subgroups
