Syntactic complexity of bifix-free languages

DOI10.1007/978-3-319-60134-2_17zbMath1429.68135arXiv1604.06936OpenAlexW2765640867MaRDI QIDQ2399256

Marek Szykuła, John Wittnebel

Publication date: 22 August 2017

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

Mathematics Subject Classification ID

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

Related Items (5)

Syntactic complexity of bifix-free languages ⋮ Syntactic complexity of regular ideals ⋮ Complexity of bifix-free regular languages ⋮ Complexity of bifix-free regular languages ⋮ Syntactic complexity of bifix-free regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
• On deterministic finite automata and syntactic monoid size
• Syntactic complexity of bifix-free languages
• Theory of átomata
• On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity
• Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals
• Syntactic Complexity of Ideal and Closed Languages
• IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
• STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
• Upper Bound on Syntactic Complexity of Suffix-Free Languages
• Large Aperiodic Semigroups
• Complexity of bifix-free regular languages

This page was built for publication: Syntactic complexity of bifix-free languages