An Algebraic Characterization of Strictly Piecewise Languages
From MaRDI portal
Publication:3010406
DOI10.1007/978-3-642-20877-5_26zbMath1331.68146OpenAlexW1533338086MaRDI QIDQ3010406
Jie Fu, Herbert G. Tanner, Jeffrey Heinz
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_26
Related Items
On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ Unnamed Item ⋮ The expressivity of autosegmental grammars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the transformation semigroups of finite automata
- On the structure of semigroups
- On Languages Piecewise Testable in the Strict Sense
- Automata Theory with Modern Applications
- On free monoids partially ordered by embedding
- Ordering by Divisibility in Abstract Algebras