Complexity of proper prefix-convex regular languages

DOI10.1007/978-3-319-60134-2_5zbMath1429.68100OpenAlexW2618190110MaRDI QIDQ5920052

Janusz A. Brzozowski, Corwin Sinnamon

Publication date: 22 August 2017

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10012/13158

zbMATH Keywords

atomregular languagestate complexitypropersyntactic semigroupmost complexquotient complexityprefix-convex

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Complexity of bifix-free regular languages ⋮ Complexity of bifix-free regular languages ⋮ Nondeterministic complexity in subclasses of convex languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On deterministic finite automata and syntactic monoid size
• The state complexities of some basic operations on regular languages
• Quotient complexity of closed languages
• Theory of átomata
• Syntactic Complexity of Ideal and Closed Languages
• Complexity of Right-Ideal, Prefix-Closed, and Prefix-Free Regular Languages
• IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
• Implementation and Application of Automata
• Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
• Complexity of atoms, combinatorially

This page was built for publication: Complexity of proper prefix-convex regular languages