Decision problems for convex languages
type: Item
instance of: scholarly article
title: Decision problems for convex languages
zbMATH Open document ID: 1217.68125
author: Zhi Xu
author: Janusz Brzozowski
author: Jeffrey Shallit
published in: Information and Computation
publication date: 2011-07-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5932319
zbMATH Keywords: finite automaton
zbMATH Keywords: complexity
zbMATH Keywords: convex language
zbMATH Keywords: regular language
zbMATH Keywords: prefix-free
zbMATH Keywords: suffix-free
zbMATH Keywords: ideal
MaRDI profile type: Publication
full work available at URL: j.ic.2010.11.009
OpenAlex ID: W2676854164
cites work: Q5306170
cites work: Q5681007
cites work: On free monoids partially ordered by embedding
cites work: Relations on free monoids, their independent sets, and codes1
cites work: Hypercodes
cites work: Q4001349
cites work: Q3653240
cites work: Q4284228
cites work: Morphisms preserving densities
cites work: Multiple-entry finite automata
cites work: A note on multiple-entry finite automata
cites work: Some remarks on multiple-entry finite automata
cites work: On NFAs where all states are final, initial, or both
cites work: Q3977588
cites work: Ultimate-Definite and Symmetric-Definite Events and Automata
cites work: Decision Problems for Convex Languages
cites work: Q3651735
cites work: Q4432976
cites work: INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Space-bounded reducibility among combinatorial problems
cites work: Q4091421
cites work: Computational Parallels between the Regular and Context-Free Languages
cites work: Q5437181
cites work: Q5592246
DOI: 10.1016/J.IC.2010.11.009
description: scientific article; zbMATH DE number 5932319