Composition and orbits of language operations: finiteness and upper bounds

DOI10.1080/00207160.2012.681305zbMath1361.68119OpenAlexW1992893569MaRDI QIDQ2855749

Émilie Charlier, Mike Domaratzki, Jeffrey O. Shallit, Tero J.Harju

Publication date: 22 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.681305

zbMATH Keywords

orbitformal languageautomatoncomplementKleene closure

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

Some remarks on the orbit of closure-involution operations on languages ⋮ Say no to case analysis: automating the drudgery of case-based proofs

Cites Work

• A generalized closure and complement phenomenon
• Operations on binary relations
• The state complexities of some basic operations on regular languages
• State complexity of combined operations
• Finite Orbits of Language Operations
• ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION

This page was built for publication: Composition and orbits of language operations: finiteness and upper bounds