Regular expression for a language without empty word

From MaRDI portal

Revision as of 15:06, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1365943

Jump to:navigation, search

DOI10.1016/0304-3975(96)00028-XzbMath0878.68080MaRDI QIDQ1365943

Djelloul Ziadi

Publication date: 10 September 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Regular expressions into finite automata

This page was built for publication: Regular expression for a language without empty word

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1365943&oldid=13516308"