Syntactic complexity of bifix-free regular languages

DOI10.1016/J.TCS.2018.12.025MaRDI QIDQ2319913zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Syntactic complexity of bifix-free languages
• Complexity of bifix-free regular languages
• Complexity of bifix-free regular languages
• Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
• Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
• Complexity of suffix-free regular languages
• Complexity of suffix-free regular languages
• scientific article; zbMATH DE number 7315105
• Syntactic complexity of suffix-free languages
• Quotient complexity of bifix-, factor-, and subword-free regular languages

Cites work

• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• Complexity of bifix-free regular languages
• Complexity of bifix-free regular languages
• In search of most complex regular languages
• Large aperiodic semigroups
• On deterministic finite automata and syntactic monoid size
• On nonpermutational transformation semigroups with an application to syntactic complexity
• Quotient complexity of regular languages
• Recursive digraphs, splinters and cylinders
• STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
• State complexity of regular languages
• Syntactic complexities of six classes of star-free languages
• Syntactic complexity of bifix-free languages
• Syntactic complexity of ideal and closed languages
• Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
• Theory of átomata
• Upper bound on syntactic complexity of suffix-free languages
• Upper bounds on syntactic complexity of left and two-sided ideals

Cited in

(9)

• On syntactic complexity of circular semi-flower automata
• scientific article; zbMATH DE number 3854452 (Why is no real title available?)
• Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
• Complexity of bifix-free regular languages
• Complexity of bifix-free regular languages
• Upper bound on syntactic complexity of suffix-free languages
• Syntactic complexity of suffix-free languages
• Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
• Syntactic complexity of bifix-free languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2319913)