Login / Signup
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs.
Stefan Hoffmann
Published in:
Int. J. Found. Comput. Sci. (2023)
Keyphrases
</>
partially ordered
partial order
totally ordered
programming language
event calculus
finite state automaton
natural language
regular expressions
pattern matching
finite state machines
interval valued
modal operators
constraint language
possibilistic logic
decision problems
total order
relational databases