The State Complexity of Lexicographically Smallest Words and Computing Successors

DOI10.1007/978-3-030-48516-0_7OpenAlexW3032213882MaRDI QIDQ5041251

Lukas Fleischer, Jeffrey O. Shallit

Publication date: 13 October 2022

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.08249

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient enumeration of words in regular languages
• Finite automata and unary languages
• Numeration systems, linear recurrences, and regular sets
• On the sequentiality of the successor function
• A Second Course in Formal Languages and Automata Theory
• On the complexity of the string generation problem
• Radix enumeration of rational languages
• Three New Algorithms for Regular Language Enumeration

This page was built for publication: The State Complexity of Lexicographically Smallest Words and Computing Successors