An Algebraic Characterization of Strictly Piecewise Languages
From MaRDI portal
Recommendations
- Mathematical Foundations of Computer Science 2004
- scientific article; zbMATH DE number 2050936
- Algebraic properties of \(LA\)-languages
- A note on algebras of languages
- scientific article; zbMATH DE number 871238
- On languages piecewise testable in the strict sense
- scientific article; zbMATH DE number 3238653
- An algorithm for the decomposition of finite languages
- The Boolean algebra of piecewise testable languages
- Algebraic characterization of logically defined tree languages
Cites work
- Automata Theory with Modern Applications
- scientific article; zbMATH DE number 5604119 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 3284302 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- On free monoids partially ordered by embedding
- On languages piecewise testable in the strict sense
- On the structure of semigroups
- On the transformation semigroups of finite automata
- Ordering by Divisibility in Abstract Algebras
Cited in
(7)- Separability by piecewise testable languages is \textsc{PTime}-complete
- The Boolean algebra of piecewise testable languages
- On languages piecewise testable in the strict sense
- Testing Simon's congruence
- Some classes of sets of structures definable without quantifiers
- The expressivity of autosegmental grammars
- On the state complexity of closures and interiors of regular languages with subwords and superwords
This page was built for publication: An Algebraic Characterization of Strictly Piecewise Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010406)
