Complexity of atoms, combinatorially

DOI10.1016/j.ipl.2016.01.003zbMath1352.68130arXiv1404.6632OpenAlexW2153026689MaRDI QIDQ5964823

Szabolcs Iván

Publication date: 1 March 2016

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

automata theoryregular languageformal languagesatoms of a languagesyntactic left-congruence classes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (14)

Quotients and atoms of reversible languages ⋮ Complexity of suffix-free regular languages ⋮ Duality of Lattices Associated to Left and Right Quotients ⋮ Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages ⋮ Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited ⋮ Most Complex Non-Returning Regular Languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Complexity of bifix-free regular languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Complexity of bifix-free regular languages ⋮ A congruence-based perspective on automata minimization algorithms ⋮ Unrestricted State Complexity of Binary Operations on Regular Languages ⋮ Descriptional complexity of regular languages ⋮ Yet another canonical nondeterministic automaton

Cites Work

• Semigroups that contain all singular transformations.
• Quotient Complexities of Atoms in Regular Ideal Languages
• Complexity of Suffix-Free Regular Languages
• Quotient Complexities of Atoms of Regular Languages
• Theory of Átomata
• Unnamed Item

This page was built for publication: Complexity of atoms, combinatorially