scientific article; zbMATH DE number 1261119
From MaRDI portal
Publication:4231580
zbMath0913.68112MaRDI QIDQ4231580
Publication date: 14 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
The State Complexity of Lexicographically Smallest Words and Computing Successors ⋮ Efficient enumeration of words in regular languages ⋮ Linear algorithm for lexicographic enumeration of CFG parse trees ⋮ Three New Algorithms for Regular Language Enumeration ⋮ Evaluation and Enumeration Problems for Regular Path Queries ⋮ Enumerating grammar-based extractions ⋮ Efficient Enumeration of Regular Languages ⋮ Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages ⋮ Finite Automata, Palindromes, Powers, and Patterns ⋮ Enumerated BSP Automata ⋮ Detecting palindromes, patterns and borders in regular languages
This page was built for publication:
