Rewriting regular inequalities

DOI10.1007/3-540-60249-6_44OpenAlexW313669978MaRDI QIDQ5055882

Valentin Antimirov

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60249-6_44

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Grammars and rewriting systems (68Q42)

Related Items

Derivatives and partial derivatives for regular shuffle expressions, Automated temporal verification for algebraic effects, The inclusion problem for regular expressions, NFA reduction algorithms by means of regular inequalities, Derivatives for Regular Shuffle Expressions, From $$\omega $$-Regular Expressions to Büchi Automata via Partial Derivatives, Regular expression order-sorted unification and matching, Inclusion Test Algorithms for One-Unambiguous Regular Expressions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rewriting extended regular expressions
• Equational properties of Kleene algebras of relations with conversion
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• On the equivalence, containment, and covering problems for the regular and context-free languages
• The state complexities of some basic operations on regular languages
• Minimal NFA Problems are Hard
• Partial derivatives of regular expressions and finite automata constructions
• Derivatives of Regular Expressions