Syntactic Complexities of Some Classes of Star-Free Languages

From MaRDI portal

Revision as of 05:42, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3167576

Jump to:navigation, search

DOI10.1007/978-3-642-31623-4_9zbMath1304.68094arXiv1109.3381OpenAlexW154460323MaRDI QIDQ3167576

Baiyu Li, Janusz A. Brzozowski

Publication date: 2 November 2012

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

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

zbMATH Keywords

finite automaton syntactic complexity monotonic syntactic semigroup star-free language partially monotonic nearly monotonic

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

This page was built for publication: Syntactic Complexities of Some Classes of Star-Free Languages

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3167576&oldid=16418023"