Representation theorems on regular languages

DOI10.1016/0022-0000(83)90031-4zbMath0516.68063OpenAlexW2042541180MaRDI QIDQ1052828

J. Blot

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90031-4

zbMATH Keywords

operatorsregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (23)

DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA ⋮ The limitedness problem on distance automata: Hashiguchi's method revisited ⋮ On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups ⋮ Distance desert automata and the star height problem ⋮ Algorithms for determining relative star height and star height ⋮ Closure properties and complexity of rational sets of regular languages ⋮ Distance automata having large finite distance or finite ambiguity ⋮ Improved limitedness theorems on finite automata with distance functions ⋮ The product of rational languages ⋮ Polynomial operations and hierarchies of concatenation ⋮ Algorithms for determining relative inclusion star height and inclusion star height ⋮ Some results on the generalized star-height problem ⋮ Rewriting of visibly pushdown languages for XML data integration ⋮ ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES ⋮ Bounded regular path queries in view-based data integration ⋮ Minimal Union-Free Decompositions of Regular Languages ⋮ The View Selection Problem for Regular Path Queries ⋮ Generic results for concatenation hierarchies ⋮ MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES ⋮ New upper bounds to the limitedness of distance automata ⋮ On the power of circular splicing ⋮ On axioms for commutative regular equations without addition. ⋮ Limitedness theorem on finite automata with distance functions: An algebraic proof

Cites Work

• Limitedness theorem on finite automata with distance functions
• A decision procedure for the order of regular events
• Transition graphs and the star-height of regular events
• The star height of reset-free events and strictly locally testable events
• Unnamed Item
• Unnamed Item

This page was built for publication: Representation theorems on regular languages