Complexity of suffix-free regular languages
From MaRDI portal
Publication:2947876
DOI10.1007/978-3-319-22177-9_12zbMATH Open1434.68239OpenAlexW2951330448MaRDI QIDQ2947876FDOQ2947876
Authors: Marek Szykuła, Janusz Brzozowski 
Publication date: 29 September 2015
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10012/12497
Recommendations
Cites Work
- Title not available (Why is that?)
- The state complexities of some basic operations on regular languages
- State complexity of regular languages
- Theory of átomata
- Quotient complexities of atoms in regular ideal languages
- Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language
- State complexity of basic operations on suffix-free regular languages
- Title not available (Why is that?)
- Succinct representation of regular languages by Boolean automata
- Quotient complexity of regular languages
- Complexity of Suffix-Free Regular Languages
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- Syntactic Complexity of Ideal and Closed Languages
- Title not available (Why is that?)
- Languages convex with respect to binary relations, and their closure properties
- IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
- Upper Bound on Syntactic Complexity of Suffix-Free Languages
- Most Complex Regular Right-Ideal Languages
Cited In (17)
- The complexity of regular(-like) expressions
- Complexity in Union-Free Regular Languages
- Theoretical Aspects of Computing – ICTAC 2005
- Title not available (Why is that?)
- Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- Complexity of bifix-free regular languages
- Complexity of bifix-free regular languages
- Overlap-Free Regular Languages
- Title not available (Why is that?)
- Syntactic complexity of suffix-free languages
- Linear-time suffix parsing for deterministic languages
- Complexity of atoms, combinatorially
- Syntactic complexity of bifix-free regular languages
- Complexity of suffix-free regular languages
- Complexity in union-free regular languages
- Complexity of Suffix-Free Regular Languages
This page was built for publication: Complexity of suffix-free regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947876)
