Constrained multi-tildes

DOI10.1007/978-3-031-40247-0_4MaRDI QIDQ6199863zbMATH OpenOpenAlexFDO

Authors Samira Attou, Ludovic Mignot, Clément Miklarz, Florent Nicart

Publication date 28 February 2024

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-40247-0_4

zbMATH Keywords

partial derivativesregular expressionsBoolean formulaemulti-tildes operators

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A Computing Procedure for Quantification Theory
• A New Family of Regular Operators Fitting with the Position Automaton Computation
• A lower bound technique for the size of nondeterministic finite automata
• A machine program for theorem-proving
• Characterization of Glushkov automata
• Erratum to ``Acyclic automata and small expressions using multi-tilde-bar operators [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435]
• How expressions can code for automata
• Multi-bar and multi-tilde regular operators
• Multi-tilde Operators and Their Glushkov Automata
• Multi-tilde-bar expressions and their automata
• Partial derivatives of regular expressions and finite automaton constructions
• The complexity of theorem-proving procedures

This page was built for publication: Constrained multi-tildes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199863)