On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity

DOI10.14232/actacyb.22.3.2016.9zbMath1363.20059arXiv1402.7289OpenAlexW1806885858MaRDI QIDQ2820787

Szabolcs Iván, Judit Nagy-György

Publication date: 9 September 2016

Published in: Acta Cybernetica (Search for Journal in Brave)

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

zbMATH Keywords

nonpermutational transformation semigroups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups of transformations, relations, partitions, etc. (20M20) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (3)

Syntactic complexity of bifix-free languages ⋮ Checking Whether an Automaton Is Monotonic Is NP-complete ⋮ Syntactic complexity of bifix-free regular languages

This page was built for publication: On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity