Constrained multi-tildes
From MaRDI portal
Publication:6199863
DOI10.1007/978-3-031-40247-0_4OpenAlexW4385701238MaRDI QIDQ6199863FDOQ6199863
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
Cites Work
- Multi-bar and multi-tilde regular operators
- Partial derivatives of regular expressions and finite automaton constructions
- Multi-tilde-bar expressions and their automata
- The complexity of theorem-proving procedures
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Characterization of Glushkov automata
- A lower bound technique for the size of nondeterministic finite automata
- Erratum to ``Acyclic automata and small expressions using multi-tilde-bar operators [Theoret. Comput. Sci. 411 (38-39) (2010) 3423-3435]
- A New Family of Regular Operators Fitting with the Position Automaton Computation
- Multi-tilde Operators and Their Glushkov Automata
- How expressions can code for automata
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)
