Regular expression for a language without empty word
From MaRDI portal
Publication:1365943
DOI10.1016/0304-3975(96)00028-XzbMath0878.68080MaRDI QIDQ1365943
Publication date: 10 September 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (6)
Acyclic automata and small expressions using multi-tilde-bar operators ⋮ Language operations with regular expressions of polynomial size ⋮ A New Family of Regular Operators Fitting with the Position Automaton Computation ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ Small Extended Expressions for Acyclic Automata ⋮ Enumerating regular expressions and their languages
Cites Work
This page was built for publication: Regular expression for a language without empty word
