Operational complexity in subregular classes
From MaRDI portal
Cites work
- Alternative automata characterization of piecewise testable languages
- Closure properties of subregular languages under operations
- Cuts in regular expressions
- Determination of finite automata accepting subregular languages
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3473324 (Why is no real title available?)
- scientific article; zbMATH DE number 2081044 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- Nondeterministic operational complexity in subregular languages
- On finite monoids having only trivial subgroups
- Operational state complexity of prefix-free regular languages
- Power-separating regular languages
- Quotient complexity of bifix-, factor-, and subword-free regular languages
- Quotient complexity of closed languages
- Quotient complexity of ideal languages
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
- Reversal of binary regular languages
- State complexity of basic operations on suffix-free regular languages
- Succinct representation of regular languages by Boolean automata
- The cut operation in subclasses of convex languages
- The range of state complexities of languages resulting from the cut operation
- The state complexities of some basic operations on regular languages
- Tight bounds for cut-operations on deterministic finite automata
- Ultimate-Definite and Symmetric-Definite Events and Automata
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Cited in
(1)
This page was built for publication: Operational complexity in subregular classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857628)
