scientific article; zbMATH DE number 6415495
From MaRDI portal
Publication:5178449
DOI10.25596/jalc-2012-083zbMath1322.68118MaRDI QIDQ5178449
Baiyu Li, David Liu, Janusz A. Brzozowski
Publication date: 16 March 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finite automatonsyntactic complexityfinite languagesyntactic semigroupstar-free languagemonotonic automatoncofinite languagedefinite languagepartially monotonic automatonreverse definite language
Related Items (6)
Syntactic complexity of bifix-free languages ⋮ Checking Whether an Automaton Is Monotonic Is NP-complete ⋮ Unnamed Item ⋮ Syntactic complexity of regular ideals ⋮ Syntactic complexity of bifix-free regular languages ⋮ Descriptional complexity of regular languages
This page was built for publication: