Syntactic complexity of bifix-free regular languages

DOI10.1016/j.tcs.2018.12.025zbMath1429.68136OpenAlexW2907458073WikidataQ128638415 ScholiaQ128638415MaRDI QIDQ2319913

Marek Szykuła, John Wittnebel

Publication date: 20 August 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.12.025

zbMATH Keywords

regular languagetransition semigroupbifix-freeprefix-freesuffix-freesyntactic complexity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• 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
• Recursive digraphs, splinters and cylinders
• 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
• Complexity of bifix-free regular languages

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